There are no minimal essentially undecidable Theories
classification
🧮 math.LO
keywords
essentiallyminimaltheoriesthereundecidableenumerableinterpretabilityrecursively
read the original abstract
We show that there is no theory that is minimal with respect to interpretability among recursively enumerable essentially undecidable theories.
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.