Decoding in the automorphism group of a recursively saturated model of arithmetic

DOI10.1002/MALQ.201400008zbMath1364.03051OpenAlexW1887824541MaRDI QIDQ5258479

Ermek S. Nurkhaidarov

Publication date: 22 June 2015

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.201400008

zbMATH Keywords

automorphism grouprecursive saturationarithmetic saturationnonstandard model of arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The finite inseparability of the first-order theory of diagonalisable algebras
• Automorphisms of recursively saturated models of arithmetic
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
• Arithmetically saturated models of arithmetic
• Interstitial and pseudo gaps in models of Peano Arithmetic
• Remarks on weak notions of saturation in models of Peano arithmetic
• Models and types of Peano's arithmetic
• Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts
• On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic
• The Automorphism Group of an Arithmetically Saturated Model of Peano Arithmetic
• Automorphism groups of arithmetically saturated models

This page was built for publication: Decoding in the automorphism group of a recursively saturated model of arithmetic