On maximal subgroups of the automorphism group of a countable recursively saturated model of PA

DOI10.1016/0168-0072(93)90035-CzbMath0796.03043MaRDI QIDQ1314639

James H. Schmerl, Henryk Kotlarski, Roman Kossak

Publication date: 26 September 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

automorphism group; models of arithmetic; maximal subgroup; pointwise stabilizer; minimal type; 2-indiscernible type; countable recursively saturated model of PA; maximal stabilizers; selective type

Mathematics Subject Classification ID

03C62: Models of arithmetic and set theory

20B27: Infinite automorphism groups

Related Items

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely, Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts, Decoding in the automorphism group of a recursively saturated model of arithmetic, Automorphisms of models of true arithmetic: Recognizing some basic open subgroups, Infinitary definitions of equivalence relations in models of PA, On cofinal submodels and elementary interstices, Automorphisms of countable recursively saturated models of PA: A survey, Four problems concerning recursively saturated models of arithmetic, Arithmetically saturated models of arithmetic, A Galois correspondence for countable short recursively saturated models of PA

Cites Work

• A note on initial segment constructions in recursively saturated models of arithmetic
• Ultrafilters and types on models of arithmetic
• Automorphisms of recursively saturated models of arithmetic
• Automorphisms of models of true arithmetic: Recognizing some basic open subgroups
• On elementary cuts in recursively saturated models of Peano Arithmetic
• Models and types of Peano's arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item