The axiom of determinateness and reduction principles in the analytical hierarchy
From MaRDI portal
Publication:5551456
DOI10.1090/S0002-9904-1968-11995-0zbMath0165.31605OpenAlexW1985995199WikidataQ114633768 ScholiaQ114633768MaRDI QIDQ5551456
Publication date: 1968
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1968-11995-0
Related Items
AD and the supercompactness of ℵ1, Models of set theory in which the separation theorem fails, The bi-embeddability relation for finitely generated groups. II, The axiom of determinacy implies dependent choices in L(R), The axiom of determinacy and the modern development of descriptive set theory, VARIATIONS ON DETERMINACY AND ℵω1, Polynomial games and determinacy, The unique existential quantifier, Uniformization in a playful universe, Axiom of comparable choice and uniformizability of projective classes, SOME CONSEQUENCES OF AND, On projective ordinals, NOTE ON IMPLYING, Borel-Piecewise Continuous Reducibility for Uniformization Problems, The Friedman embedding theorem., Minimal Covers and Arithmetical Sets, Uniform Martin’s conjecture, locally, On characterizing Spector classes, Factoring Solovay-random extensions, with application to the reduction property, Believing the axioms. II, A characterization of jump operators, There is no degree invariant half-jump, BASIS THEOREMS FOR -SETS, One hundred and two problems in mathematical logic, TD implies \(\operatorname{CC}_{\mathbb{R}} \), Inner models from extended logics: Part 1, Degree Spectra of Relations on a Cone, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, On Martin’s pointed tree theorem, A classification of jump operators, An application of Σ40 determinacy to the degrees of unsolvability, Some measure theoretic results in effective descriptive set theory, Coding by club-sequences, The uniform Martin’s conjecture for many-one degrees, On the ultrafilter of closed, unbounded sets, On the First Order Theory of the Arithmetical Degrees, Analytic determinacy and 0#, Computable numberings of families of infinite sets, Minimal Covers and Hyperdegrees, The Theory of Countable Analytical Sets, Turing degrees in Polish spaces and decomposability of Borel functions, Martin's conjecture and strong ergodicity, ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE, A measure representation theorem for strong partition cardinals, Determinacy implies that \(\aleph_ 2\) is supercompact, Effective randomness for continuous measures, Uniformity, universality, and computability theory, Weak truth table degrees of structures
Cites Work
