Related papers: $\sigma$-continuity and related forcings

This article is devoted to the interplay between forcing with fusion and combinatorial covering properties. We discuss known instances of this interplay as well as present a new one, namely that in the Laver model for the consistency of the…

In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…

The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing…

Following the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok and J. Zapletal we study Borel equivalences on Laver trees. Here we prove that equivalence relations Borel reducible to an equivalence relation…

Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

We consider a class of second order ordinary differential equations describing one-dimensional systems with a quasi-periodic analytic forcing term and in the presence of damping. As a physical application one can think of a…

We define a $\sigma$-centered notion of forcing that forces the existence of a Boolean algebra with the Grothendieck property and without the Nikodym property. In particular the existence of such an algebra is consistent with the negation…

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

Forcing was first introduced by Paul J. Cohen in his work on the independence of the Continuum Hypothesis. Other formulations of forcing appeared using Model Theory, Boolean-valued Models, and Topos Theory. There is a folkloric claim that…

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

We prove that various classical tree forcings -- for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve the statement that every real has a sharp and hence analytic determinacy. We then…

We develop a forcing framework based on the idea of amalgamating language fragments into a theory with a canonical term model. We then demonstrate the usefulness of this framework by applying it to variants of the extended Namba problem, as…

In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [JR1] in which several problems were posed. We answer some of those problems here.

We ask for a given system of polynomials f_1,...,f_n and f over the complex numbers when there exist continuous functions q_1,...,q_n such that q_1 f_1+...+q_n f_n = f. This condition defines the continuous closure of an ideal. We give…

Consider a difference equation which takes the k-th largest output of m functions of the previous m terms of the sequence. If the functions are also allowed to change periodically as the difference equation evolves this is analogous to a…

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…