Related papers: Forcing and Construction Schemes
In this paper we prove that a planar set $\mathcal{X}$ of at most $mn-1$ points, where $m \le n$, is $\kappa$-dependent, if and only if there exists a number r, $1 \le r \le m-1$, and an essentially $\kappa$-dependent subset $\mathcal{Y}…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
We analyze the intermediate models of the strongly compact Prikry forcing. We exhibit a simple combinatorial property which, for a given supercompact cardinal $\kappa$, characterize the projections of all projections of the strongly compact…
We give a systematic approach to constructing non-reduced, locally Cohen-Macaulay schemes with reduced support a smooth projective variety. The hierarchy of such structures includes a lot of information about the underlying variety, its…
We present some results about generics for computable Mathias forcing. The $n$-generics and weak $n$-generics in this setting form a strict hierarchy as in the case of Cohen forcing. We analyze the complexity of the Mathias forcing…
We show that from a supercompact cardinal \kappa, there is a forcing extension V[G] that has a symmetric inner model N in which ZF + not AC holds, \kappa\ and \kappa^+ are both singular, and the continuum function at \kappa\ can be…
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
Build systems are a fundamental part of software construction, but their correctness has received comparatively little attention, relative to more prominent parts of the toolchain. In this paper, we address the correctness of \emph{forward…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
Assuming the negation of Chang's conjecture, there is a c.c.c. forcing which adds a strongly non-saturated Aronszajn tree. Using a Mahlo cardinal, we construct a model in which there exists a strongly non-saturated Aronszajn tree and the…
We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…
Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…
We give some general criteria, when kappa-complete forcing preserves largeness properties -- like kappa-presaturation of normal ideals on lambda (even when they concentrate on small cofinalities). Then we quite accurately obtain the…
With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…
We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increasing size, which possesses similar characteristics to sparse…
Suppose that $T^*$ is an $\omega_1$-Aronszajn tree with no stationary antichain. We introduce a forcing axiom PFA($T^*$) for proper forcings which preserve these properties of $T^*$. We prove that PFA($T^*$) implies many of the strong…
Sequence to Sequence models struggle at compositionality and systematic generalisation even while they excel at many other tasks. We attribute this limitation to their failure to internalise constructions conventionalised form meaning…