Automorphisms of models of arithmetic: a unified view

DOI10.1016/J.APAL.2006.05.013zbMath1115.03037OpenAlexW2116350865MaRDI QIDQ866555

Ali Enayat

Publication date: 14 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.apal.2006.05.013

zbMATH Keywords

automorphism groupPeano arithmeticrecursive saturationiterated ultrapowerstrong cut

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Infinite automorphism groups (20B27)

Related Items (5)

The Complexity of Classification Problems for Models of Arithmetic ⋮ Iterated ultrapowers for the masses ⋮ Fixed points of self-embeddings of models of arithmetic ⋮ A Galois correspondence for countable short recursively saturated models of PA ⋮ Rank-initial embeddings of non-standard models of set theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ultrafilters and types on models of arithmetic
• Recursively saturated models generated by indiscernibles
• Automorphisms of recursively saturated models of arithmetic
• On two questions concerning the automorphism groups of countable recursively saturated models of PA
• Automorphisms with only infinite orbits on non-algebraic elements
• Automorphisms of countable recursively saturated models of PA: A survey
• Arithmetically saturated models of arithmetic
• Partition Theorems and Computability Theory
• Automorphisms of models of bounded arithmetic
• On elementary cuts in recursively saturated models of Peano Arithmetic
• Note on Canonical Partitions
• Results on automorphisms of recursively saturated models of PA
• Closure properties of countable non-standard integers
• Models and types of Peano's arithmetic
• Some problem in elementary arithmetics
• A simple tree lemma and its application to a counterexample of philips
• Toward model theory through recursive saturation
• Automorphisms moving all non-algebraic points and an application to NF
• Automorphisms of Recursively Saturated Models of Peano Arithmetic: Fixed Point Sets
• Automorphism groups of models of Peano arithmetic
• Some applications of iterated ultrapowers in set theory
• A Combinatorial Theorem

This page was built for publication: Automorphisms of models of arithmetic: a unified view