Automorphisms of recursively saturated models of arithmetic (Q1182432): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(91)90098-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055731527 / rank
 
Normal rank

Revision as of 21:44, 19 March 2024

scientific article
Language Label Description Also known as
English
Automorphisms of recursively saturated models of arithmetic
scientific article

    Statements

    Automorphisms of recursively saturated models of arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    The authors investigate the automorphism group of countable recursively saturated models of PA. For \(M\) a model of PA, \(Aut(M)\) is considered as a topological group where the topology is generated by the basic open subgroups \(G_{(a)} = \{ g\in Aut(M): g(a) = a\}\). They show that for any consistent complementation \(T\) of PA there are countable \(M_ 1,\;M_ 2\) of \(T\) with \(Aut(M_ 1)\not\cong Aut(M_ 2)\) as topological groups. The authors completely characterize the initial segments \(I\subset_ e M\) which are of the form \(I = \{ x\in M: g(x)=x\}\). All known facts about normal subgroups of \(Aut(M)\) are surveyed. It is shown that for \(M\models Th(\mathbb{N})\), \(H\) is a normal subgroup of \(M\) iff \(H=G_ A=\{ g\in Aut(M): g(a)=a\text{ for all }a\in A\}\) for some \(A\subseteq M\}\).
    0 references
    automorphism group
    0 references
    countable recursively saturated models of PA
    0 references
    initial segments
    0 references
    0 references

    Identifiers