The automorphism group of a resplendent model

DOI10.1007/s00153-012-0288-5zbMath1251.03039arXiv1112.4370OpenAlexW2010853888MaRDI QIDQ453194

James H. Schmerl

Publication date: 18 September 2012

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

Full work available at URL: https://arxiv.org/abs/1112.4370

zbMATH Keywords

undecidabilityautomorphism grouprecursive saturationresplendent models

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items (1)

ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC

Cites Work

• A course in model theory. An introduction to contemporary mathematical logic. Transl. from the French by Moses Klein
• Automorphism groups of models of Peano arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The automorphism group of a resplendent model