相关论文: The Ground Axiom (GA)
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…
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…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
We study principles of the form: if a name $\sigma$ is forced to have a certain property $\varphi$, then there is a ground model filter $g$ such that $\sigma^g$ satisfies $\varphi$. We prove a general correspondence connecting these name…
We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $\varphi(a)$ in the first-order language of set theory is true in the set-theoretic universe $V$, then it is also true in a proper inner…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
Argumentation frameworks, consisting of arguments and an attack relation representing conflicts, are fundamental for formally studying reasoning under conflicting information. We use methods from mathematical logic, specifically…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…
In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…
We present several generalizations of the well-known Kunen inconsistency that there is no nontrivial elementary embedding from the set-theoretic universe V to itself. For example, there is no elementary embedding from the universe V to a…
According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been…
This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
I explore two separate topics: the concept of jointness for set-theoretic guessing principles, and the notion of grounded forcing axioms. A family of guessing sequences is said to be joint if all of its members can guess any given family of…
It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…
We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…