Forcing by non-scattered sets

Annals of Pure and Applied Logic 163 (9):1299-1308 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,047

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

Sets in Prikry and Magidor generic extensions.Tom Benhamou & Moti Gitik - 2021 - Annals of Pure and Applied Logic 172 (4):102926.
Splitting families and forcing.Miloš S. Kurilić - 2007 - Annals of Pure and Applied Logic 145 (3):240-251.
Template iterations with non-definable ccc forcing notions.Diego A. Mejía - 2015 - Annals of Pure and Applied Logic 166 (11):1071-1109.
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.
A Π12 singleton incompatible with 0#.M. C. Stanley - 1994 - Annals of Pure and Applied Logic 66 (1):27-88.

Analytics

Added to PP
2013-10-27

Downloads
39 (#567,216)

6 months
9 (#451,423)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.
Different similarities.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (7-8):839-859.

View all 8 citations / Add more citations

References found in this work

Forcing with quotients.Michael Hrušák & Jindřich Zapletal - 2008 - Archive for Mathematical Logic 47 (7-8):719-739.

Add more references