Related papers: The Ground Axiom
In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…
We describe the non-minimal Standard Model, consisting of minimalistic extensions of the Standard Model, which for all we know is the theory of the universe, able to describe all of the universe from the beginning of time. Extensions…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…
We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…
It is shown that the existence of a measurable cardinal is equiconsistent to a model of ZFC in which there is no ordinal-definable, stationary, costationary subset of $\omega_1$
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 introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an…
In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…
The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…
The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…
We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…
We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…