Omitting types: application to recursion theory

DOI10.2307/2272549zbMath0244.02016OpenAlexW1987686945MaRDI QIDQ5655353

T. J. Grilliot

Publication date: 1972

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

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

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Recursive equivalence types of sets and structures, isols (03D50) Hierarchies of computability and definability (03D55)

Related Items

Countable admissible ordinals and hyperdegrees, More Lowenheim-Skolem results for admissible sets, Omitting Types: Application to Descriptive Set Theory

Cites Work

• The Suslin-Kleene theorem for countable structures
• On a problem of Kleene’s
• Constructive transfinite number classes
• Completing theories by forcing