Models as Side Conditions

Piotr Koszmider
Additional contact information
Piotr Koszmider: Auburn University, Department of Mathematics

A chapter in Set Theory, 1998, pp 99-107 from Springer

Abstract: Abstract The purpose of the method in the title, which was established by Stevo Todorcevic ([4], [5]), is to overcome certain problems in proving that some partial orders preserve ω1 . More specifically, the problems with amalgamating conditions while attempting to prove the countable chain condition of partial orders. The general idea is to put inside conditions of forcing notions some extra demands which will make the amalgamation easier. The point is that if one involves models into these extra demands, one is rewarded. These extra demands increase the complexity of the condition (and are no longer finite) and so one has no choice but to forget about proving that the modified partial order satisfies the c.c.c. One tries to prove the properness of the modified forcing. This boils down to the proof that certain conditions are generic2 over certain models.

Keywords: Partial Order; Partition Problem; Side Condition; Force Notion; Elementary Chain (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-8988-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9789401589888

DOI: 10.1007/978-94-015-8988-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().