Automorphisms of countable recursively saturated models of PA: A survey

DOI10.1305/NDJFL/1040136912zbMATH Open0848.03015OpenAlexW1974949696MaRDI QIDQ1913626

Henryk Kotlarski

Publication date: 22 May 1996

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040136912

zbMATH Keywords

surveyautomorphism groupsopen problemsrecursive saturationcountable recursively saturated models of Peano Arithmetic

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite permutation groups. II: Subgroups of small index
• Recursively saturated models generated by indiscernibles
• Automorphisms of recursively saturated models of arithmetic
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• Infinitary logic: In memoriam Carol Karp. A collection of papers by various authors
• On closed elementary cuts in recursively saturated models of Peano arithmetic
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
• Automorphisms of models of true arithmetic: Recognizing some basic open subgroups
• On two questions concerning the automorphism groups of countable recursively saturated models of PA
• Models of axiomatic theories admitting automorphisms
• On elementary cuts in recursively saturated models of Peano Arithmetic
• GROUPS OF AUTOMORPHISMS OF N₀-CATEGORICAL STRUCTURES
• Results on automorphisms of recursively saturated models of PA
• Recursively saturated nonstandard models of arithmetic
• The Automorphism Group of a Countable Recursively Saturated Structure
• Models and types of Peano's arithmetic
• Models with compactness properties relative to an admissible language
• Models Without Indiscernibles
• Toward model theory through recursive saturation
• The Small Index Property for ω‐Stable ω‐Categorical Structures and for the Random Graph
• 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
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic

Related Items (8)

Unnamed Item ⋮ Automorphisms of models of arithmetic: a unified view ⋮ Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts ⋮ Automorphisms of recursively saturated models of arithmetic ⋮ A Galois correspondence for countable short recursively saturated models of PA ⋮ Automorphism groups of countable arithmetically saturated models of Peano arithmetic ⋮ Automorphism groups of models of Peano arithmetic ⋮ Automorphism groups of arithmetically saturated models

Recommendations

• Unnamed Item 👍 👎
• Automorphisms of saturated and boundedly saturated models of arithmetic 👍 👎
• Automorphisms of countable short recursively saturated models of PA 👍 👎
• Automorphisms of recursively saturated models of arithmetic 👍 👎
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA 👍 👎
• On two questions concerning the automorphism groups of countable recursively saturated models of PA 👍 👎
• Automorphism groups of countable arithmetically saturated models of Peano arithmetic 👍 👎
• Results on automorphisms of recursively saturated models of PA 👍 👎
• Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts 👍 👎
• Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets 👍 👎

This page was built for publication: Automorphisms of countable recursively saturated models of PA: A survey