Transfinite extensions of Friedberg's completeness criterion

DOI10.2307/2272313zbMath0382.03030OpenAlexW2086986908MaRDI QIDQ4161312

John MacIntyre

Publication date: 1977

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272313

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

A non-inversion theorem for the jump operator, The arithmetic and Turing degrees are not elementarily equivalent, Boolean algebras, Stone spaces, and the iterated Turing jump, The periodic power of \(\mathcal A\) and complete Horn theories, Model-theoretic aspects of unification, On the structure of the Wadge degrees of bqo-valued Borel functions, Measuring complexities of classes of structures, Forcing and reducibilities, Jumps of Orderings, Spectra of theories and structures, Forcing and reductibilities. II. Forcing in fragments of analysis, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers

Cites Work

• Unnamed Item