Some applications of forcing to hierarchy problems in arithmetic

DOI10.1002/malq.19690152004zbMath0191.30601OpenAlexW2065227285MaRDI QIDQ5585410

Peter G. Hinman

Publication date: 1969

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

A note on the enumeration degrees of 1-generic sets, A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory, Classes of Polish spaces under effective Borel isomorphism, Inductive definability: Measure and category, Generic oracles, uniform machines, and codes, Polish Group Actions and the Vaught Conjecture, An effective selection theorem, The generic oracle hypothesis is false, Forcing and reducibilities, Notions of weak genericity, Some measure theoretic results in effective descriptive set theory, On the reducibility of \(\Pi_ 1^ 1\) sets, Degrees of Dowd-type generic oracles, Complexity of the \(r\)-query tautologies in the presence of a generic oracle, Forcing and reductibilities. II. Forcing in fragments of analysis, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers