Model completeness and relative decidability
From MaRDI portal
Publication:2042736
DOI10.1007/s00153-020-00753-4OpenAlexW3119991094WikidataQ105642085 ScholiaQ105642085MaRDI QIDQ2042736
Jennifer Chubb, D. Reed Solomon, Russell G. Miller
Publication date: 21 July 2021
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.00734
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Generic copies of countable structures
- Model theory.
- Degree spectra and computable dimensions in algebraic structures
- Trivial, strongly minimal theories are model complete after naming constants
- There is no classification of the decidably presentable structures
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- Unnamed Item
- Unnamed Item
- Unnamed Item