Computability of homogeneous models

DOI10.1305/ndjfl/1172787551zbMath1123.03027OpenAlexW2067702126MaRDI QIDQ998144

Robert I. Soare, Karen Lange

Publication date: 10 August 2007

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/05203c8709fa8e4c96c6e25e8be14ad78ae255c7

zbMATH Keywords

computability theoryprime modelssaturated modelsTuring degreecomputable model theoryhomogeneous modelscomplete decidable theory

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28)

Related Items (4)

Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ A characterization of the 0-basis homogeneous bounding degrees ⋮ The degree spectra of homogeneous models ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations

This page was built for publication: Computability of homogeneous models