Applications of iterated perfect set forcing
type: Item
instance of: scholarly article
title: Applications of iterated perfect set forcing
zbMATH Open document ID: 0651.03039
DOI: 10.1016/0168-0072(88)90044-9
author: Marcia Groszek
published in: Annals of Pure and Applied Logic
publication date: 1988-01-01T00:00:00Z
review text: Perfect set forcing has been used by Sacks to generate a model of ZF with a minimal L-degree. The author improves on the method of iterated perfect set forcing to encode information on the generic sequence into the partial order on the L-degrees (or, more generally, M-degrees for M an inner model of ZF), the problem being that the degree ordering on the reals is absolute while the generic sequence choosing one real from each degree is not. Her strategy is designed to obtain results both on the partial ordering of the M-degrees and the partial ordering \({\mathcal M}[\Phi]\) of countable transitive models of \(ZF+\Phi\) of the same height. Applications yield a minimal model for \(\neg CH\) (while Sacks' method produces a minimal model of \(V\neq L)\) and a model with a real minimal w.r.t. collapsing cardinals. Concerning the partial ordering \({\mathcal M}[\Phi]\) it is shown that \({\mathcal M}[AC]\) admits no non-trivial automorphism, \({\mathcal M}[\neg CH]\) and \({\mathcal M}[V\neq L]\) are not isomorphic. Added are two appendices on the existence of minimal models for Martin's Axiom MA (a result due to Shelah) and for \(\neg CH+MA\) resp. (a theorem of Woodin).
reviewed by: K.Gloede
Mathematics Subject Classification ID: 03D35
Mathematics Subject Classification ID: 03E50
zbMATH DE Number: 4061227
zbMATH Keywords: iterated perfect set forcing
zbMATH Keywords: partial order
zbMATH Keywords: L-degrees
zbMATH Keywords: M-degrees
zbMATH Keywords: minimal models
zbMATH Keywords: Martin's Axiom
MaRDI profile type: Publication
full work available at URL: 0168-0072(88)90044-9
OpenAlex ID: W2079843043
cites work: On finite lattices of degrees of constructibility of reals
cites work: Q4147977
cites work: On Sequences of Degrees of Constructibility (Solution of Friedman'S Problem 75)
cites work: Q3037420
cites work: Iterated perfect-set forcing
cites work: Q3921212
cites work: THE FIRST‐ORDER THEORY OF THE c‐DEGREES
cites work: Q3853619
cites work: Q5656764
cites work: Q5626664
cites work: Set theory. An introduction to independence proofs
cites work: On the consistency of Borel's conjecture
cites work: Mapping a set of reals onto the reals
cites work: Q5632568
cites work: Countable admissible ordinals and hyperdegrees
cites work: Q4170713
description: scientific article; zbMATH DE number 4061227