Properness Without Elementaricity
From MaRDI portal
Recommendations
- Non-elementary proper forcing
- Properness under closed forcing
- Almost strong properness
- Axiomatics of set theory without element relation
- Elementary propositions and independence
- Honest elementary degrees and degrees of relative provability without the cupping property
- Pure elements of quantales
- scientific article; zbMATH DE number 3939317
- DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESS
- Provability logic without Craig's interpolation property
Cites work
- A combinatorial forcing for coding the universe by a real when there are no sharps
- Forcings with ideals and simple forcing notions
- How special are Cohen and random forcings, i. e. Boolean algebras of the family of subsets of reals moduli meagre or null
- Iteration of Souslin forcing, projective measurability and the Borel conjecture
- More on real-valued measurable cardinals and forcing with ideals
- More on simple forcing notions and forcings with ideals
- Norms on Possibilities II: More CCC Ideals on 2 ω
- On Nicely Definable Forcing Notions
- Souslin forcing
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
Cited in
(23)- Sweet \& sour and other flavours of ccc forcing notions
- Effective forcing versus proper forcing
- Proper forcing and rectangular Ramsey theorems
- Measured creatures
- Preserving non-null with Suslin^+ forcings
- Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
- Borel conjecture and dual Borel conjecture
- Non-Cohen Oracle C.C.C.
- Applications of the ergodic iteration theorem
- scientific article; zbMATH DE number 5511094 (Why is no real title available?)
- Many countable support iterations of proper forcings preserve Souslin trees
- Cichoń's diagram, regularity properties and \(\varDelta^1_3\) sets of reals
- Trivial automorphisms
- Hypergraphs and proper forcing
- Non-elementary proper forcing
- A parallel to the null ideal for inaccessible \(\lambda\). I
- On Nicely Definable Forcing Notions
- Reasonably complete forcing notions
- Preserving preservation
- On Russell typicality in set theory
- Nice ℵ1 generated non‐P‐points, Part I
- Corrected iteration
- Abstract corrected iterations
This page was built for publication: Properness Without Elementaricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4668849)
