Automorphisms of models of arithmetic: a unified view

DOI10.1016/J.APAL.2006.05.013zbMATH Open1115.03037OpenAlexW2116350865MaRDI QIDQ866555FDOQ866555

Authors: 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

Recommendations

• Automorphisms of models of bounded arithmetic
• Automorphisms of recursively saturated models of arithmetic
• Automorphisms of saturated and boundedly saturated models of arithmetic
• ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC
• Automorphisms and constructions of models of set theory
• scientific article; zbMATH DE number 889876
• Automorphism groups of arithmetically saturated models
• On the number of automorphisms of uncountable models
• Automorphism groups of models of Peano arithmetic
• Automorphisms of models of true arithmetic: Recognizing some basic open subgroups

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)

Cites Work

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

Cited In (10)

• A Galois correspondence for countable short recursively saturated models of PA
• Title not available (Why is that?)
• Models of arithmetic in \(A\)-isols
• Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
• Iterated ultrapowers for the masses
• Rank-initial embeddings of non-standard models of set theory
• Model companions of theories with an automorphism
• Automorphisms of recursively saturated models of arithmetic
• Fixed points of self-embeddings of models of arithmetic
• The complexity of classification problems for models of arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866555)