According to Cantor, a set is a collection into a whole of defined and separate (we shall say distinct) objects. So, a natural question is ``How to treat as `sets' collections of indistinguishable objects?". This is the aim of quasi-set theory, and this problem was posed as the first of present day mathematics, in the list resulting from the Congress on the Hilbert Problems in 1974. Despite this pure mathematical motivation, quasi-sets have also a strong commitment to the way quantum physics copes with elementary particles. In this paper, we discuss the axiomatics of quasi-set theory and sketch some of its applications in physics. We also show that quasi-set theory allows us a better and deeper understanding of the role of the concept of equality in mathematics.
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class includes the example of unordered trees of any arity.
We prove that the propositional logic of intuitionistic set theory IZF is intuitionistic propositional logic IPC. More generally, we show that IZF has the de Jongh property with respect to every intermediate logic that is complete with respect to a class of finite trees. The same results follow for CZF.
In recent years the question of whether adding the limited principle of omniscience, LPO, to constructive Zermelo-Fraenkel set theory, CZF, increases its strength has arisen several times. As the addition of excluded middle for atomic formulae to CZF results in a rather strong theory, i.e. much stronger than classical Zermelo set theory, it is not obvious that its augmentation by LPO would be proof-theoretically benign. The purpose of this paper is to show that CZF +RDC+ LPO has indeed the same strength as CZF, where RDC stands for relativized dependent choice. In particular, these theories pr…
By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of the exponential function. We then prove a choiceless Easton's theorem: one can force the surjective exponential function on all infinite cardinals to take arbitrary cardinal values, provided monotonicity and Cantor's theorem are satisfied, irrespective of cofinalities.
Can a positive function on R have zero Lebesgue integral? It depends on how much choice one has. Keywords: Lebesgue integral; Zermelo--Fraenkel theory; Feferman-Levy model
We show that in Zermelo-Fraenkel Set Theory without the Axiom of Choice a surjectively modified continuum function $θ(κ)$ can take almost arbitrary values for all infinite cardinals. This choiceless version of Easton's Theorem is in sharp contrast to the situation in ZFC, where for singular cardinals $κ$, the value of $2^κ$ is strongly influenced by the behaviour of the continuum function below. Our construction can roughly be described as follows: In a ground model $V \models ZFC + GCH$ with a "reasonable" function $F: Card \rightarrow Card$ on the infinite cardinals, a class forcing ${\mathb…
We show that in the theory ZF + DC + for every cardinal λ, the set of infinite subsets of λ is well-ordered (i.e., Shelah's AX4), the θ-function measuring the surjective size of the powersets P(κ) can take almost arbitrary values on any set of uncountable cardinals. This complements our results from [FK16], where we prove that in ZF (without DC), any possible behavior of the θ-function can be realized; and answers a question of Shelah in [She16], where he emphasizes that ZF + DC + AX4 is a reasonable theory, where much of set theory and combinatorics is possible.
In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we are able to prove that all set-theoretic axioms of ZF are valid over these models. The proof is strongly based on the existence of paraconsistent models of Leibniz law. In this setting, the difficulty of having algebraic paraconsistent models of law for formulas with negation using the standard interpretation map is discussed, showing that the existence of mod…
The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set theory we may define an explicit association of definable classes with set objects $F\mapsto\varepsilon F$ in such a way, I shall prove, to realize Frege's Basic Law V as a ZF theorem scheme, Russell notwithstanding. A similar analysis applies to the Cantor-Hume principle and to Fregean abstraction generally. Because these extension and abstraction operators ar…
Recently, the Elementary Process Theory (EPT) has been developed as a set of fundamental principles that might underlie a gravitational repulsion of matter and antimatter. This paper presents set matrix theory (SMT) as the foundation of the mathematical-logical framework in which the EPT has been formalized: Zermelo-Fraenkel set theory (ZF), namely, cannot be used as such. SMT is a generalization of ZF: whereas ZF uses only sets as primitive objects, in the framework of SMT finite matrices with set-valued entries are objects sui generis, with a one-by-one set matrix [x] being identical to the …
We show that if (M,E,E') satisfies the first order Zermelo-Fraenkel axioms of set theory when the membership relation is E and also when the membership relation is E', and in both cases the formulas are allowed to contain both E and E', then (M,E) and (M,E') are isomorphic, and the isomorphism is definable in (M,E,E'). This extends Zermelo's 1930 theorem about second order ZFC.
We introduce the concept of inverse powerset by adding three axioms to the Zermelo-Fraenkel set theory. This extends the Zermelo-Fraenkel set theory with a new type of set which is motivated by an intuitive meaning and interesting applications. We present different ways to extend the definition of cardinality and show that one implies the continuum hypothesis while another implies the negation of the continuum hypothesis. We will also explore the idea of empty sets of different cardinalities which could be seen as the empty counterpart of Cantor's theorem for infinite sets.
In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving rise to a realizability universe $\mathrm{V_{ex}}(A)$ in which the axiom of choice in all finite types ${\sf AC}_{\sf FT}$ is realized, where $A$ stands for an arbitrary partial combinatory algebra. This construction furnishes 'inner models' of many set theories that additionally validate ${\sf AC}_{\sf FT}$, in particular it provides a self-validating seman…
We show that the existence of a weakly compact cardinal over the Zermelo-Fraenkel's set theory is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.
In this note we generalize the Moroianu's fixed point theorem. We propose a very elegant common proof of the Bourbaki's fixed point theorem and our result. We apply our result to give a very elegant proof of the fact that, in the Zermelo-Fraenkel system, the axiom of choice is equivalent to each of the following statements: H. Kneser's Lemma, Zorn's Lemma, Zermelo's Lemma
We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification of this principle.
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set theory obtained by requiring every set theoretical construction to be finitely supported according to a certain action of a group of permutations of some basic elements named atoms. Its main purpose is to let us characterize infinite algebraic structures, defined involving atoms, only by analyzing their finite supports. The first goal of this paper is to defi…
We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of Choice. We give two presentations of equivariance, accompanied by detailed yet user-friendly discussions of its theoretical significance and practical application.
We employ the Zermelo-Fraenkel Axioms that characterize sets as mathematical primitives. The Anti-foundation Axiom plays a significant role in our development, since among other of its features, its replacement for the Axiom of Foundation in the Zermelo-Fraenkel Axioms motivates Platonic interpretations. These interpretations also depend on such allied notions for sets as pictures, graphs, decorations, labelings and various mappings that we use. A syntax and semantics of operators acting on sets is developed. Such features enable construction of a theory of non-well-founded sets that we use to…
We show that the existence of a Pi^{1}_{N}-indescribable cardinal over the Zermelo-Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and lower Mahlo operations. Furthermore we describe a proof-theoretic bound on definable countable ordinals whose existence is provable from the existence of second order indescribable cardinals over ZF.
We introduce the forcing model of IZFA (Intuitionistic Zermelo-Fraenkel set theory with Atoms) for every Grothendieck topology and prove that the topos of sheaves on every site is equivalent to the category of 'sets in this forcing model'.
Inspired by Zermelo's quasi-categoricity result characterizing the models of second-order Zermelo-Fraenkel set theory $\text{ZFC}_2$, we investigate when those models are fully categorical, characterized by the addition to $\text{ZFC}_2$ either of a first-order sentence, a first-order theory, a second-order sentence or a second-order theory. Thus we mount an analysis of the categorical large cardinals. This mathematical analysis leads naturally to philosophical issues concerning structuralism and realism, including especially the tension between categoricity and reflection. Ultimately we ident…
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom of choice nor provable in Zermelo-Fraenkel set theory without the axiom of choice. Thus, it is a new weak choice principle. Nevertheless, the restriction of the principle to sets of reals (among other general instances) is provable without the axiom of choice.
In contrast to the robust mutual interpretability phenomenon in set theory, Ali Enayat proved that bi-interpretation is absent: distinct theories extending ZF are never bi-interpretable and models of ZF are bi-interpretable only when they are isomorphic. Nevertheless, for natural weaker set theories, we prove, including Zermelo-Fraenkel set theory $\text{ZFC}^-$ without power set and Zermelo set theory Z, there are nontrivial instances of bi-interpretation. Specifically, there are well-founded models of $\text{ZFC}^-$ that are bi-interpretable, but not isomorphic---even $\langle H_{ω_1},\in\ra…
In this paper we develop a theory called $σ$-Set Theory, in which we present an axiom system developed from the study of Set Theories of Zermelo-Fraenkel, Neumann-Bernays-Godel and Morse-Kelley. In $σ$-Set Theory, we present the proper existence of objects called $σ$-antielement, $σ$-antiset, natural numbers, antinatural numbers and generated $σ$-set by two $σ$-sets, from which we obtain, among other things, a commutative non-associative algebraic structure called Integer Space $3^{X}$, which corresponds to the algebraic completion of $2^{X}$.
We show, in Zermelo-Fraenkel set theory without the Axiom of Choice, that the existence of a discontinuous homomorphism of the additive group of real numbers induces a selector for the Vitali equivalence relation $\mathbb{R}/\mathbb{Q}$. This shows that a nonprincipal ultrafilter on the integers is not sufficient to construct a discontinuous automorphism of the complex field, confirming a conjecture of Simon Thomas. This is an improved version of our paper in the Proceedings of the American Mathematical Society, which used a weak version of the Axiom of Choice for the same result.
We introduce a general theory of functions called Flow. We prove ZF, non-well founded ZF and ZFC can be immersed within Flow as a natural consequence from our framework. The existence of strongly inaccessible cardinals is entailed from our axioms. And our first important application is the introduction of a model of Zermelo-Fraenkel set theory where the Partition Principle (PP) holds but not the Axiom of Choice (AC). So, Flow allows us to answer to the oldest open problem in set theory: if PP entails AC.
What is the slightest modification of ZF to add a complement-axiom? The answer in my Ph.D. thesis 1971 was ZF'': Zermelo-Fraenkel with replacement for only well-founded domains and an omega-axiom. In 1974, Alonzo Church published a similar system, as did Urs Oswald in 1976. In his 1976 Ph.D. thesis, E. Mitchell also designed, a system very similar to ZF''. In this article we argue that ZF'' is the slightest modification of ZF among all these systems and that its successor ZFK is the simplest set theory with a universal set at all.
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK and the theory of hyperuniverses. On the other hand, it retains most of the expressiveness of these theories and has the same consistency strength as ZF. We single out the additional axiom of the universal set as the one that increases the consistency strength to that of GPK and explore several other axioms and interrelations between those theories. Our resul…
Zermelo's Axiom of Separation is: Exist x: Forall y: (y in x <==> y in a & E(y)) with definite(E) and parameter a. Thoralf Skolem suggested to characterize the terminus "definite" by "the property E should be representable by a FOL formula". But that is trivial. "definite" must mean more. The author claims that "definite" means "in accordance with the theory of definitions of logic". In this case the theorem of Cantor is no longer a theorem, but a undecidable sentence, and has to be established explicitly as axiom. This is not done by the community, but it is made a silent assumption that we c…
Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My conjecture is that this method works well because mathematicians use only those predicates to form sets, which yield closed hereditary consistent predicate extensions. And for every open formula they use in the process of constructing of a certain (special) set (bottom up), we can always find an "almost-closed" formula (i.e. a parameter-free formula with only the f…
Whilst Power Kripke-Platek set theory, KPP, shares many properties with ordinary Kripke-Platek set theory, KP, in several ways it behaves quite differently from KP. This is perhaps most strikingly demonstrated by a result, due to Mathias, to the effect that adding the axiom of constructibility to KPP gives rise to a much stronger theory, whereas in the case of KP the constructible hierarchy provides an inner model, so that KP and KP+V=L have the same strength. This paper will be concerned with the relationship between KPP and KPP plus the axiom of choice or even the global axiom of choice, GAC…
Frege's Grundgesetze was one of the 19th century forerunners to contemporary set theory which was plagued by the Russell paradox. In recent years, it has been shown that subsystems of the Grundgesetze formed by restricting the comprehension schema are consistent. One aim of this paper is to ascertain how much set theory can be developed within these consistent fragments of the Grundgesetze, and our main theorem shows that there is a model of a fragment of the Grundgesetze which defines a model of all the axioms of Zermelo-Fraenkel set theory with the exception of the power set axiom. The proof…
Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $Δ_0$-separation and set foundation. This paper studies the relative strength of set theories obtained by adding fragments of the set-theoretic collection scheme to $\mathbf{M}$. We focus on two common parameterisations of collection: $Π_n$-collection, which is the usual collection scheme restricted to $Π_n$-formulae, and strong $Π_n$-collection, which is equivalent to $Π_n$-collection plus $Σ_{n+1}$-separation. The main result of this paper…
Until the 1970s, proof theoretic investigations were mainly concerned with theories of inductive definitions, subsystems of analysis and finite type systems. With the pioneering work of Gerhard Jaeger in the late 1970s and early 1980s, the focus switched to set theories, furnishing ordinal-theoretic proof theory with a uniform and elegant framework. More recently it was shown that these tools can even sometimes be adapted to the context of strong axioms such as the powerset axiom, where one does not attain complete cut elimination but can nevertheless extract witnessing information and charact…
