Expansions of models and turing degrees

DOI10.2307/2273590zbMath0527.03013OpenAlexW2010586901MaRDI QIDQ3043119

Mark E. Nadel, Julia F. Knight

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/2273590

zbMATH Keywords

omitting types theoremTuring degreesrecursively saturated modelrecursively saturated structure

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Models with special properties (saturated, rigid, etc.) (03C50) Other degrees and reducibilities in computability and recursion theory (03D30) Model theory of denumerable and separable structures (03C15)

Related Items (4)

Representing Scott sets in algebraic settings ⋮ Bounded Scott Set Saturation ⋮ Degrees of Recursively Saturated Models ⋮ Which set existence axioms are needed to prove the separable Hahn-Banach theorem?

Cites Work

• Unnamed Item
• Sets which do not have subsets of every higher degree
• Class groups of integral group rings

This page was built for publication: Expansions of models and turing degrees