Page 1

Displaying 1 – 6 of 6

Showing per page

Perfect sets and collapsing continuum

Miroslav Repický (2003)

Commentationes Mathematicae Universitatis Carolinae

Under Martin’s axiom, collapsing of the continuum by Sacks forcing 𝕊 is characterized by the additivity of Marczewski’s ideal (see [4]). We show that the same characterization holds true if 𝔡 = 𝔠 proving that under this hypothesis there are no small uncountable maximal antichains in 𝕊 . We also construct a partition of ω 2 into 𝔠 perfect sets which is a maximal antichain in 𝕊 and show that s 0 -sets are exactly (subsets of) selectors of maximal antichains of perfect sets.

Proper forcings and absoluteness in L ( )

Itay Neeman, Jindřich Zapletal (1998)

Commentationes Mathematicae Universitatis Carolinae

We show that in the presence of large cardinals proper forcings do not change the theory of L ( ) with real and ordinal parameters and do not code any set of ordinals into the reals unless that set has already been so coded in the ground model.

Properties of forcing preserved by finite support iterations

Miroslav Repický (1991)

Commentationes Mathematicae Universitatis Carolinae

We shall investigate some properties of forcing which are preserved by finite support iterations and which ensure that unbounded families in given partially ordered sets remain unbounded.

Provident sets and rudimentary set forcing

A. R. D. Mathias (2015)

Fundamenta Mathematicae

Using the theory of rudimentary recursion and provident sets expounded in [MB], we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s J ω . Much of the development is rudimentary or at worst given by rudimentary recursions with parameter the notion of forcing under consideration. Our development eschews the power set axiom. We...

Currently displaying 1 – 6 of 6

Page 1