Related papers: Joint Laver diamonds and grounded forcing axioms
We define a class of formal systems inspired by Prawitz's theory of grounds. The latter is a semantics that aims at accounting for epistemic grounding, namely, at explaining why and how deductively valid inferences have the power to…
Applying a force to certain supramolecular bonds may initially stabilize them, manifested by a lower dissociation rate. We show that this behavior, known as catch bonding and by now broadly reported in numerous biophysics bonds, is…
Menger conjectured that subsets of R with the Menger property must be ${\sigma}$-compact. While this is false when there is no restriction on the subsets of R, for projective subsets it is known to follow from the Axiom of Projective…
Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…
We prove the consistency of the failure of the weak diamond $\Phi_\lambda$ at strongly inaccessible cardinals. On the other hand, we show that the very weak diamond $\Psi_\lambda$ is equivalent to the statement $2^{<\lambda}<2^\lambda$ and…
What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…
The axioms of ZFC provide a foundation for mathematics, however, there are statements independent of ZFC, such as the Continuum Hypothesis (CH). We discuss Martin's axiom, which is an alternative to CH that roughly states that if there is a…
Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…
Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first singular cardinal. These principles have found many other…
Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…
The author gave a proof of a generalization of the Aztec diamond theorem for a family of $4$-vertex regions on the square lattice with southwest-to-northeast diagonals drawn in (Electron. J. Combin., 2014) by using a bijection between…
This paper synthesizes a series of formal proofs to construct a unified theory on the logical limits of the Symbol Grounding Problem. We distinguish between internal meaning (sense), which formal systems can possess via axioms, and external…
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…
Some models of combinatorial principles have been obtained by collapsing a huge cardinal in the case of the successors of regular cardinals. For example, saturated ideals, Chang's conjecture, polarized partition relations, and transfer…
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 introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
We define extender sequences, generelizing measure sequences from Radin Forcing. Using the extender sequences we combine Gitik-Magidor forcing for adding many Prikry sequences with Radin forcing. This forcing satisfies Prikry like…