Prime models of computably enumerable degree

DOI10.2178/JSL/1230396926MaRDI QIDQ5502824zbMATH OpenOpenAlexFDO

Authors Rachel Epstein

Publication date 9 January 2009

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1230396926

zbMATH Keywords

complete atomic decidable theoriescomputably enumerable degreeshomogeneous modelslownessminimal pairprime models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Degree spectra of prime models
• Degrees of categoricity for prime and homogeneous models
• Computability of homogeneous models
• On decidable categoricity and almost prime models
• The degree spectra of homogeneous models

Cites work

• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Constructive models of complete solvable theories
• Degrees coded in jumps of orderings
• The degree spectra of homogeneous models

Cited in

(6)

• Degrees of categoricity for prime and homogeneous models
• Prime models of finite computable dimension
• Classifying model-theoretic properties
• Prime models and almost decidability
• Degree spectra of prime models
• Bounding prime models

This page was built for publication: Prime models of computably enumerable degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502824)