The Suslin-Kleene theorem for countable structures

DOI10.1215/S0012-7094-70-03744-0MaRDI QIDQ2542989zbMATH OpenFDO

Authors Yiannis N. Moschovakis

Publication date 1970

Published in Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1215/S0012-7094-70-03744-0

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(9)

• Two theorems about projective sets
• Recursion in a quantifier vs. elementary induction
• Refinements of Vaught's normal from theorem
• Game sentences, recursive saturation and definability
• Strict-Π₁¹ predicates on countable and cofinality ω transitive sets
• Inductive Definitions and Computability
• The Game Quantifier
• Omitting types: application to recursion theory
• Introduction to Turing categories

This page was built for publication: The Suslin-Kleene theorem for countable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2542989)