pith. sign in

arxiv: 1707.06702 · v1 · pith:S6UG4LIEnew · submitted 2017-07-20 · 🧮 math.LO

Boolean ultrapowers, the Bukovsky-Dehornoy phenomenon, and iterated ultrapowers

classification 🧮 math.LO
keywords booleanmodelultrapowerforcingphenomenonultrapowersbukovsky-dehornoygeneric
0
0 comments X
read the original abstract

We show that while the length $\omega$ iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Prikry forcing, it is consistent that no iteration of length greater than $\omega$ (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a generalization of Prikry forcing as examples. We refer to the discovery that the intersection of the finite iterates of the universe by a normal measure is the same as the generic extension of the direct limit model by the critical sequence as the Bukovsky-Dehornoy phenomenon, and we develop a sufficient criterion (the existence of a simple skeleton) for when a version of this phenomenon holds in the context of Boolean ultrapowers. Assuming that the canonical generic filter over the Boolean ultrapower model has what we call a continuous representation, we show that the Boolean model consists precisely of those members of the intersection model that have continuously and eventually uniformly represented codes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.