Intrinsically Hyperarithmetical Sets
From MaRDI portal
Publication:5687410
DOI10.1002/malq.19960420139zbMath0859.03016OpenAlexW2074416304MaRDI QIDQ5687410
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
forcingenumerationsrecursive structureabstract computabilityexternal definabilityformal definabilityintrinsically hyperarithmetical setsKueker's theorem
Related Items
Π11 relations and paths through ⋮ Preserving categoricity and complexity of relations ⋮ 2007 Annual Meeting of the Association for Symbolic Logic ⋮ The complexity of computable categoricity ⋮ Categoricity of computable infinitary theories ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ Intrinsic bounds on complexity and definability at limit levels ⋮ Enumerations in computable structure theory ⋮ Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
Cites Work