相关论文: The Ground Axiom
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
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^{++}$…
It is true in the Cohen, Solovay-random, dominaning, and Sacks generic extension that every countable ordinal-definable set of reals belongs to to the ground universe
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
A positive mass theorem for General Relativity Theory is proved. The proof is 4-dimensional in nature, and relies completely on arguments pertaining to causal structure, the basic idea being that positive energy-density focuses null…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
The present paper is concerned with the relation between recurrence axioms and Laver-generic large cardinal axioms in light of principles of generic absoluteness and the Ground Axiom. M. Viale proved that Martin's Maximum$^{++}$ together…
Quantified modal logic provides a natural logical language for reasoning about modal attitudes even while retaining the richness of quantification for referring to predicates over domains. But then most fragments of the logic are…
Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
In this article the author claims that there is a paradigm shift from ZFC to NFUM and further to NACT - due to philosophical reasons, not mathematical ones. The goal is to construct systems where every "Not-Properclass" is a set! With help…
It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…
Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…