The Automorphism Group of a Resplendent Model
James H. Schmerl
TL;DR
This paper proves that the first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable, highlighting complexity in model automorphism groups.
Contribution
It establishes the undecidability of the first-order theory of automorphism groups for a specific class of models, extending understanding of their logical complexity.
Findings
First-order theory of automorphism groups is undecidable.
Focus on infinite resplendent models in finite languages.
Results contribute to model theory and automorphism group analysis.
Abstract
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Opinion Dynamics and Social Influence