Intrinsically Hyperarithmetical Sets

DOI10.1002/MALQ.19960420139MaRDI QIDQ5687410zbMATH OpenOpenAlexFDO

Authors Ivan N. Soskov

Publication date 23 February 1997

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19960420139

zbMATH Keywords

abstract computabilityenumerationsexternal definabilityforcingformal definabilityintrinsically hyperarithmetical setsKueker's theoremrecursive structure

Mathematics Subject Classification ID

Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 7332477
• The Complexity of intrinsically r.e. subsets of existentially decidable models
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Hyperarithmetical Index Sets in Recursion Theory
• Intrinsically II Relations

Cites work

• Elementary induction on abstract structures
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Perfect subsets of definable sets of real numbers

Cited in

(16)

• Categoricity of computable infinitary theories
• The inner core and the strictly inhibitive set
• Enumerations in computable structure theory
• Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Hyperarithmetical Sets
• Intrinsic bounds on complexity and definability at limit levels
• 2007 Annual Meeting of the Association for Symbolic Logic
• The complexity of computable categoricity
• Intrinsically II Relations
• Π₁¹ relations and paths through
• Ash's theorem for abstract structures
• The Complexity of intrinsically r.e. subsets of existentially decidable models
• scientific article; zbMATH DE number 7332477 (Why is no real title available?)
• Ivan Soskov: a life in computability
• Preserving categoricity and complexity of relations

This page was built for publication: Intrinsically Hyperarithmetical Sets

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