The Automorphism Group of a Resplendent Model
classification
🧮 math.LO
keywords
automorphismgroupmodelresplendentfinitefirst-orderinfinitelanguage
read the original abstract
The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.