Related papers: New consequences of PFA($T^*$)

Fairness impossibility results often look like distinct scalar incompatibility statements. We show that several share one RKHS geometry: fairness criteria are linear constraints on conditional mean embeddings, and unequal base rates make…

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…

Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an $\omega_2$-Aronszajn tree, the $\omega_1$-approachability property fails, and every stationary subset of $\omega_2 \cap \mathrm{cof}(\omega)$…

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) =…

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

We analyze the possibility to measure small thermal effects in the Casimir force between metal test bodies in configurations of a sphere above a plate and two parallel plates. For sphere-plate geometry used in many experiments we…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make…

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(T)$ of a normal $\kappa$-tree $T$. The latter is an invariant in the sense that if $T$ and $T'$ are club-isomorphic, then the…

Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…

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 generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…

Let $\mathsf{MM}^{++}(\kappa)$ state that the forcing axiom $\mathsf{MM}^{++}$ can be instantiated only for stationary set preserving posets of size at most $\kappa$. We give a detailed account of Asper\`o and Schindler's proof that…