The role of true finiteness in the admissible recursively enumerable degrees
From MaRDI portal
Publication:5471360
DOI10.1090/memo/0854zbMath1096.03052OpenAlexW2320209375MaRDI QIDQ5471360
Publication date: 6 June 2006
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0854
Models of arithmetic and set theory (03C62) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
The theory of the \(\alpha \) degrees is undecidable ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES ⋮ Computable categoricity for pseudo-exponential fields of \(\aleph_1\)
