Constructibility and Class Forcing

Sy D. Friedman ()
Additional contact information
Sy D. Friedman: Universität Wien, Kurt Gödel Research Center for Mathematical Logic

Chapter 8 in Handbook of Set Theory, 2010, pp 557-604 from Springer

Abstract: Abstract In this article we discuss the basic theory and applications of class forcing, with an emphasis on three problems posed by Solovay which can be resolved using it. As class forcing, unlike traditional set forcing, does not in general preserve $\mathop {\rm ZFC}$ , we first isolate the first-order property of tameness, necessary and sufficient for this preservation. After mentioning four basic examples, we discuss the question of the generic existence for class forcing before turning to the most important technique in the subject, the technique of Jensen coding. Armed with these ideas we then proceed to describe the solutions to the Solovay problems. We next discuss generic saturation, a concept which helps to explain the special role of 0# in this theory. We end by briefly describing some other applications.

Keywords: Ground Model; Generic Extension; Elementary Embedding; Class Force; Inaccessible Cardinal (search for similar items in EconPapers)
Date: 2010
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-1-4020-5764-9_9

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

DOI: 10.1007/978-1-4020-5764-9_9

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 ().