Automorphisms of recursively saturated models of arithmetic

DOI10.1016/0168-0072(91)90098-7zbMath0748.03023OpenAlexW2055731527MaRDI QIDQ1182432

Roman Kossak, Henryk Kotlarski, Richard W. Kaye

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90098-7

zbMATH Keywords

automorphism groupinitial segmentscountable recursively saturated models of PA

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Model theory of denumerable and separable structures (03C15)

Related Items (20)

Automorphisms of models of true arithmetic: Recognizing some basic open subgroups ⋮ The Complexity of Classification Problems for Models of Arithmetic ⋮ More automorphism groups of countable, arithmetically saturated models of Peano arithmetic ⋮ Automorphisms of models of arithmetic: a unified view ⋮ Iterated ultrapowers for the masses ⋮ Automorphisms of countable recursively saturated models of PA: A survey ⋮ Four problems concerning recursively saturated models of arithmetic ⋮ Arithmetically saturated models of arithmetic ⋮ Infinitary definitions of equivalence relations in models of PA ⋮ Fixed points of self-embeddings of models of arithmetic ⋮ Interstitial and pseudo gaps in models of Peano Arithmetic ⋮ A Galois correspondence for countable short recursively saturated models of PA ⋮ Transplendent models: expansions omitting a type ⋮ AUTOMORPHISM GROUPS OF COUNTABLE ARITHMETICALLY SATURATED MODELS OF PEANO ARITHMETIC ⋮ Automorphism groups of models of Peano arithmetic ⋮ Automorphism groups of arithmetically saturated models ⋮ Rank-initial embeddings of non-standard models of set theory ⋮ Automorphisms moving all non-algebraic points and an application to NF ⋮ Decoding in the automorphism group of a recursively saturated model of arithmetic ⋮ On maximal subgroups of the automorphism group of a countable recursively saturated model of PA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursively saturated \(\omega _ 1\)-like models of arithmetic
• Infinite permutation groups. II: Subgroups of small index
• Recursively saturated models generated by indiscernibles
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• On cofinal extensions of models of arithmetic
• On elementary cuts in models of arithmetic
• On elementary cuts in recursively saturated models of Peano Arithmetic
• Some remarks on initial segments in models of Peano arithmetic
• ω₁-like recursively saturated models of Presburger's arithmetic
• Results on automorphisms of recursively saturated models of PA
• Models with the ω-property
• Recursively saturated nonstandard models of arithmetic
• A Note on Real Subsets of A Recursively Saturated Model
• The Automorphism Group of a Countable Recursively Saturated Structure
• Models and types of Peano's arithmetic
• Toward model theory through recursive saturation
• Discernible elements in models for Peano arithmetic

This page was built for publication: Automorphisms of recursively saturated models of arithmetic