Some applications of forcing to hierarchy problems in arithmetic

DOI10.1002/MALQ.19690152004MaRDI QIDQ5585410zbMATH OpenOpenAlexFDO

Authors 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

Cited in

(16)

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

This page was built for publication: Some applications of forcing to hierarchy problems in arithmetic

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