Preserving levels of projective determinacy by tree forcings

DOI10.1016/J.APAL.2020.102918MaRDI QIDQ2659097zbMATH OpenOpenAlexFDO

Authors Fabiana Castiblanco, Philipp Schlicht

Publication date 25 March 2021

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.12079

zbMATH Keywords

mouse operatorprojective determinacysharpsthin relationstree forcinguniform indiscernibles

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Generic absoluteness and forcing axioms (03E57) Determinacy principles (03E60)

Abstract: We prove that various classical tree forcings -- for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve the statement that every real has a sharp and hence analytic determinacy. We then lift this result via methods of inner model theory to obtain level-by-level preservation of projective determinacy (PD). Assuming PD, we further prove that projective generic absoluteness holds and no new equivalence classes classes are added to thin projective transitive relations by these forcings.

Recommendations

• Generic absoluteness under projective forcing
• Forcing over models of determinacy
• Thin equivalence relations and inner models
• The consistency strength of projective absoluteness
• Variations of the Martin-Solovay tree

Cites work

• A \(\pi^1_2\) singleton with no sharp in a generic extension of \(L^\#\)
• A basis theorem for \(\sum^ 1_ 3\) sets of reals
• A criterion for coarse iterability
• A playful approach to Silver and Mathias forcings
• An outline of inner model theory
• Analytic determinacy and 0^#
• Cichoń's diagram, regularity properties and \(\varDelta^1_3\) sets of reals
• Combinatorial Set Theory
• Combinatorics on ideals and forcing
• Forcing absoluteness and regularity properties
• Happy families
• scientific article; zbMATH DE number 3884145 (Why is no real title available?)
• scientific article; zbMATH DE number 5504385 (Why is no real title available?)
• scientific article; zbMATH DE number 567513 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 787541 (Why is no real title available?)
• scientific article; zbMATH DE number 3358471 (Why is no real title available?)
• Iterated forcing and elementary embeddings
• Large cardinals and definable counterexamples to the continuum hypothesis
• Large cardinals from determinacy
• Measurable cardinals and analytic games
• Measurable cardinals and the continuum hypothesis
• On the consistency of Borel's conjecture
• Optimal Proofs of Determinacy
• Proper forcing extensions and Solovay models
• Pure and hybrid mice with finitely many Woodin cardinals from levels of determinacy
• Set Theory
• Set theory. Exploring independence and truth
• Small forcing creates neither strong nor Woodin cardinals
• The Size of the Ordinal u ₂
• The strength of choiceless patterns of singular and weakly compact cardinals
• Thin equivalence relations and effective decompositions
• Thin equivalence relations and inner models

Cited in

(2)

• Uniformization and internal absoluteness
• When is a real generic over L?

This page was built for publication: Preserving levels of projective determinacy by tree forcings

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