The Suslin-Kleene theorem for countable structures
From MaRDI portal
Publication:2542989
DOI10.1215/S0012-7094-70-03744-0zbMath0207.01202MaRDI QIDQ2542989
Publication date: 1970
Published in: Duke Mathematical Journal (Search for Journal in Brave)
Related Items (9)
Omitting types: application to recursion theory ⋮ Inductive Definitions and Computability ⋮ The Game Quantifier ⋮ Recursion in a quantifier vs. elementary induction ⋮ Strict-Π11 predicates on countable and cofinality ω transitive sets ⋮ Refinements of Vaught's normal from theorem ⋮ Introduction to Turing categories ⋮ Game sentences, recursive saturation and definability ⋮ Two theorems about projective sets
This page was built for publication: The Suslin-Kleene theorem for countable structures