Related papers: Forcing, genericity and CBERS
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
We consider the Cauchy problem for the Burgers hierarchy with general time dependent coefficients. The closed form for the Green's function of the corresponding linear equation of arbitrary order $N$ is shown to be a sum of generalised…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
In this paper, we consider the mean curvature flow of convex hypersurfaces in Euclidean spaces with a general forcing term. We show that the flow may shrink to a point in finite time if the forcing term is small, or exist for all times and…
We give an algorithm for testing uniformity of distributions supported on hypergrids $[m_1] \times \cdots \times [m_n]$, which makes $\smash{\widetilde{O}(\text{poly}(m)\sqrt{n}/\epsilon^2)}$ many queries to a subcube conditional sampling…
We determine all affinely homogeneous models for surfaces $S^2 \subset \mathbb{R}^4$, including the simply transitive models. We employ an improved power series method of equivalence, which captures invariants at the origin, creates…
We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…
We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…
For a finite quiver $Q$, we study the reachability category $\mathbf{Reach}_Q$. We investigate the properties of $\mathbf{Reach}_Q$ from both a categorical and a topological viewpoint. In particular, we compare $\mathbf{Reach}_Q$ with…
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
In this paper we analyse and compare two different notions of regularity for filters on complete Boolean algebras. We also announce two results from a forthcoming paper in preparation, which provide a characterization of Keisler's order in…
We prove a generic flatness result for the cohomology of thickenings of a projective scheme that is smooth over a Noetherian domain containing a field of characteristic zero. Our study is motivated, in part, by a classical question in…
It has long been conjectured that starting at a generic smooth closed embedded surface in R^3, the mean curvature flow remains smooth until it arrives at a singularity in a neighborhood of which the flow looks like concentric spheres or…
We give a partial answer to the following question of Dobrinen: For a given topological Ramsey space $\mathcal{R}$, are the notions of selective for $\mathcal{R}$ and Ramsey for $\mathcal{R}$ equivalent? Every topological Ramsey space…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…
The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is…
In algebraic geometry, one often encounters the following problem: given a scheme X, find a proper birational morphism from Y to X where the geometry of Y is "nicer" than that of X. One version of this problem, first studied by Faltings,…
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,…