Arithmetically saturated models of arithmetic
A model of a first-order theory is arithmetically saturated if it is saturated with respect to the types that are arithmetic in the complete types realized in the model. The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. The results concern the automorphism group of a countable recursively saturated model of PA. New results on fixed point sets, open subgroups, and the cofinality of the automorphisms group are given. It is also shown that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of the elementary substructures of the model.
- Automorphisms of recursively saturated models of arithmetic
- Finite Substructure Lattices of Models of Peano Arithmetic
- scientific article; zbMATH DE number 3959428 (Why is no real title available?)
- scientific article; zbMATH DE number 3724423 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 57851 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- scientific article; zbMATH DE number 663795 (Why is no real title available?)
- Models with the ω-property
- On elementary cuts in recursively saturated models of Peano Arithmetic
- On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
- Recursively saturated nonstandard models of arithmetic; addendum
- Subgroups of Infinite Symmetric Groups
- The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
- The Small Index Property for ω‐Stable ω‐Categorical Structures and for the Random Graph
- Ultrafilters and types on models of arithmetic
- On cofinal submodels and elementary interstices
- Models of arithmetic in \(A\)-isols
- Order-types of models of arithmetic and a connection with arithmetic saturation
- Automorphism groups of countable arithmetically saturated models of Peano arithmetic
- Automorphism groups of saturated models of Peano arithmetic
- The complexity of classification problems for models of arithmetic
- Recursively saturated nonstandard models of arithmetic; addendum
- Regularity in models of arithmetic
- Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets
- Automorphism groups of models of Peano arithmetic
- Bounded Scott Set Saturation
- scientific article; zbMATH DE number 1746899 (Why is no real title available?)
- scientific article; zbMATH DE number 7183906 (Why is no real title available?)
- Decoding in the automorphism group of a recursively saturated model of arithmetic
- Automorphism groups of arithmetically saturated models
- scientific article; zbMATH DE number 2236641 (Why is no real title available?)
- Saturated models
- Automorphisms of saturated and boundedly saturated models of arithmetic
- Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
- The lattice problem for models of \(\mathsf{PA}\)
- Automorphisms of models of arithmetic: a unified view
This page was built for publication: Arithmetically saturated models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913628)
