Template iterations with non-definable ccc forcing notions

Annals of Pure and Applied Logic 166 (11):1071-1109 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

A formalism for some class of forcing notions.Piotr Koszmider & P. Koszmider - 1992 - Mathematical Logic Quarterly 38 (1):413-421.
Universal forcing notions and ideals.Andrzej Rosłanowski & Saharon Shelah - 2007 - Archive for Mathematical Logic 46 (3-4):179-196.
Reasonable Ultrafilters, Again.Andrzej Rosłanowski & Saharon Shelah - 2011 - Notre Dame Journal of Formal Logic 52 (2):113-147.
How much sweetness is there in the universe?Andrzej Rosłanowski & Saharon Shelah - 2006 - Mathematical Logic Quarterly 52 (1):71-86.
Simplified RCS iterations.Chaz Schlindwein - 1993 - Archive for Mathematical Logic 32 (5):341-349.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Pointwise definable models of set theory.Joel David Hamkins, David Linetsky & Jonas Reitz - 2013 - Journal of Symbolic Logic 78 (1):139-156.
▵1 3-Stability.Dror Ben-Arié & Haim Judah - 1993 - Journal of Symbolic Logic 58 (3):941 - 954.
Iterations of Boolean algebras with measure.Anastasis Kamburelis - 1989 - Archive for Mathematical Logic 29 (1):21-28.
Unfoldable cardinals and the GCH.Joel David Hamkins - 2001 - Journal of Symbolic Logic 66 (3):1186-1198.
Radin forcing and its iterations.John Krueger - 2007 - Archive for Mathematical Logic 46 (3-4):223-252.
N–localization property.Andrzej Rosłanowski - 2006 - Journal of Symbolic Logic 71 (3):881 - 902.

Analytics

Added to PP
2015-08-28

Downloads
34 (#445,975)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?