Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T00:59:39.898Z Has data issue: false hasContentIssue false

Backwards easton forcing and 0#

Published online by Cambridge University Press:  12 March 2014

M. C. Stanley*
Affiliation:
Department of Mathematics and Computer Science, San Jose State University, San Jose, California 95192

Abstract

It is shown that if κ is an uncountable successor cardinal in L[0#], then there is a normal tree T ϵ L[0#] of height κ such that 0# ∉ L[T], yet T is < κ-distributive in L[0#]. A proper class version of this theorem yields an analogous L[0#]-definable tree such that distinct branches in the presence of 0# collapse the universe. A heretofore unutilized method for constructing in L[0#] generic objects for certain L-definable forcings and “exotic sequences”, combinatorial principles introduced by C. Gray, are used in constructing these trees.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable