Forcing the [math]-separation property

Journal of Mathematical Logic 22 (2) (2022)
  Copy   BIBTEX

Abstract

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We generically construct a model in which the [math]-separation property is true, i.e. every pair of disjoint [math]-sets can be separated by a [math]-definable set. This answers an old question from the problem list “Surrealist landscape with figures” by A. Mathias from 1968. We also construct a model in which the (lightface) [math]-separation property is true.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Separation problems and forcing.Jindřich Zapletal - 2013 - Journal of Mathematical Logic 13 (1):1350002.
Fragility and indestructibility of the tree property.Spencer Unger - 2012 - Archive for Mathematical Logic 51 (5-6):635-645.
Mathias absoluteness and the Ramsey property.Lorenz Halbeisen & Haim Judah - 1996 - Journal of Symbolic Logic 61 (1):177-194.
Making doughnuts of Cohen reals.Lorenz Halbeisen - 2003 - Mathematical Logic Quarterly 49 (2):173-178.
Understanding preservation theorems, II.Chaz Schlindwein - 2010 - Mathematical Logic Quarterly 56 (5):549-560.
Forcing properties of ideals of closed sets.Marcin Sabok & Jindřich Zapletal - 2011 - Journal of Symbolic Logic 76 (3):1075 - 1095.
Symmetries between two Ramsey properties.Lorenz Halbeisen - 1998 - Archive for Mathematical Logic 37 (4):241-260.
Indestructibility of the tree property.Radek Honzik & Šárka Stejskalová - 2020 - Journal of Symbolic Logic 85 (1):467-485.
The short extenders gap three forcing using a morass.Carmi Merimovich - 2011 - Archive for Mathematical Logic 50 (1-2):115-135.
Distributive proper forcing axiom and cardinal invariants.Huiling Zhu - 2013 - Archive for Mathematical Logic 52 (5-6):497-506.
Forcing disabled.M. C. Stanley - 1992 - Journal of Symbolic Logic 57 (4):1153-1175.
Forcing the Least Measurable to Violate GCH.Arthur W. Apter - 1999 - Mathematical Logic Quarterly 45 (4):551-560.

Analytics

Added to PP
2022-06-23

Downloads
8 (#1,249,165)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Optimal proofs of determinacy.Itay Neeman - 1995 - Bulletin of Symbolic Logic 1 (3):327-339.
Cardinal characteristics and projective wellorders.Vera Fischer & Sy David Friedman - 2010 - Annals of Pure and Applied Logic 161 (7):916-922.
Ns Saturated and -Definable.Stefan Hoffelner - 2021 - Journal of Symbolic Logic 86 (1):25-59.

View all 8 references / Add more references