Effective prime uniqueness
From MaRDI portal
Abstract: Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to the theorem that there are two atomic decidable models which are not computably isomorphic. The implications of this work in reverse mathematics is that "effectively prime implies effectively atomic" holds in topped models. But due to an observation of David Belanger, "effectively prime implies effectively atomic" fails for some Scott sets. The reserve mathematical strength of "Prime Uniqueness" remains open.
Recommendations
Cites work
Cited in
(9)- Computable trees, prime models, and relative decidability
- Some Questions in Computable Mathematics
- Degree spectra of prime models
- A note on decidable categoricity and index sets
- Classifying model-theoretic properties
- Effectively existentially-atomic structures
- Constructivizability of a prime model
- On some forms of atomicity among countable models in the class \(E^+_T\) for \(\Delta-\mathrm{PJ}\)-theories and \(\Delta-\mathrm{PR}\)-theories
- Bounding prime models
This page was built for publication: Effective prime uniqueness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592760)