Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-17T23:06:16.407Z Has data issue: false hasContentIssue false

CLASS FORCING, THE FORCING THEOREM AND BOOLEAN COMPLETIONS

Published online by Cambridge University Press:  01 December 2016

PETER HOLY
Affiliation:
MATH. INSTITUT UNIVERSITÄT BONN ENDENICHER ALLEE 60, 53115 BONN, GERMANY E-mail: pholy@math.uni-bonn.de
REGULA KRAPF
Affiliation:
MATH. INSTITUT UNIVERSITÄT BONN ENDENICHER ALLEE 60, 53115 BONN, GERMANY E-mail: krapf@math.uni-bonn.de
PHILIPP LÜCKE
Affiliation:
MATH. INSTITUT UNIVERSITÄT BONN ENDENICHER ALLEE 60, 53115 BONN, GERMANY E-mail: pluecke@math.uni-bonn.de
ANA NJEGOMIR
Affiliation:
MATH. INSTITUT UNIVERSITÄT BONN ENDENICHER ALLEE 60, 53115 BONN, GERMANY E-mail: njegomir@math.uni-bonn.de
PHILIPP SCHLICHT
Affiliation:
MATH. INSTITUT UNIVERSITÄT BONN ENDENICHER ALLEE 60, 53115 BONN, GERMANYINSTITUT FÜR MATHEMATISCHE LOGIK UND GRUNDLAGENFORSCHUNG UNIVERSITÄT MÜNSTER EINSTEINSTR. 62, 48149 MÜNSTER, GERMANY E-mail: schlicht@math.uni-bonn.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma can fail for class forcing.

In addition to these negative results, we show that the forcing theorem is equivalent to the existence of a (certain kind of) Boolean completion, and we introduce a weak combinatorial property (approachability by projections) that implies the forcing theorem to hold. Finally, we show that unlike for set forcing, Boolean completions need not be unique for class forcing.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2016