Prime models of computably enumerable degree

DOI10.2178/jsl/1230396926zbMath1155.03017OpenAlexW2035438180MaRDI QIDQ5502824

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

minimal pairprime modelslownesscomputably enumerable degreeshomogeneous modelscomplete atomic decidable theories

Mathematics Subject Classification ID

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

Cites Work

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

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