The automorphism group of a resplendent model (Q453194): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
This short paper is devoted to the proof of one theorem: If \(M\) is an infinite resplendent structure for some finite first-order language, then the theory of the automorphism group of \(M\) is undecidable. The result is closely related to the result of \textit{V. V. Bludov, M. Giraudet, A. M. W. Glass} and \textit{G. Sabbagh} [``Automorphism groups of models of first order theories'', in: Models, modules and abelian groups. In memory of A. L. S. Corner. Berlin: Walter de Gruyter. 325--328 (2008; Zbl 1188.03025)] stating that if \(T\) is an arbitrary first-order theory having an infinite model, then it has a model whose automorphism group is undecidable. In this result the language is not assumed to be finite. Schmerl's proof relies on the proof of Bludov et~al.~and on a general result of Schmerl on automorphism groups of countable recursively saturated structures. | |||
Property / review text: This short paper is devoted to the proof of one theorem: If \(M\) is an infinite resplendent structure for some finite first-order language, then the theory of the automorphism group of \(M\) is undecidable. The result is closely related to the result of \textit{V. V. Bludov, M. Giraudet, A. M. W. Glass} and \textit{G. Sabbagh} [``Automorphism groups of models of first order theories'', in: Models, modules and abelian groups. In memory of A. L. S. Corner. Berlin: Walter de Gruyter. 325--328 (2008; Zbl 1188.03025)] stating that if \(T\) is an arbitrary first-order theory having an infinite model, then it has a model whose automorphism group is undecidable. In this result the language is not assumed to be finite. Schmerl's proof relies on the proof of Bludov et~al.~and on a general result of Schmerl on automorphism groups of countable recursively saturated structures. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Roman Kossak / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03C50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6083825 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
automorphism group | |||
Property / zbMATH Keywords: automorphism group / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
resplendent models | |||
Property / zbMATH Keywords: resplendent models / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
recursive saturation | |||
Property / zbMATH Keywords: recursive saturation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
undecidability | |||
Property / zbMATH Keywords: undecidability / rank | |||
Normal rank |
Revision as of 10:55, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The automorphism group of a resplendent model |
scientific article |
Statements
The automorphism group of a resplendent model (English)
0 references
18 September 2012
0 references
This short paper is devoted to the proof of one theorem: If \(M\) is an infinite resplendent structure for some finite first-order language, then the theory of the automorphism group of \(M\) is undecidable. The result is closely related to the result of \textit{V. V. Bludov, M. Giraudet, A. M. W. Glass} and \textit{G. Sabbagh} [``Automorphism groups of models of first order theories'', in: Models, modules and abelian groups. In memory of A. L. S. Corner. Berlin: Walter de Gruyter. 325--328 (2008; Zbl 1188.03025)] stating that if \(T\) is an arbitrary first-order theory having an infinite model, then it has a model whose automorphism group is undecidable. In this result the language is not assumed to be finite. Schmerl's proof relies on the proof of Bludov et~al.~and on a general result of Schmerl on automorphism groups of countable recursively saturated structures.
0 references
automorphism group
0 references
resplendent models
0 references
recursive saturation
0 references
undecidability
0 references