Related papers: Is set theory indispensable?
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…
Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…
Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented…
This paper introduces a new theory which encompasses concepts and ideas from set theory, type theory, and Le\'{s}niewski's mereology and describes its possibility as an alternative foundation for mathematics. In the introduction section I…
The basics of set theory are usually copied, directly or indirectly, by computer scientists from introductions to mathematical texts. Often mathematicians are content with special cases when the general case is of no mathematical interest.…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
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…
Mathematicians and philosophers have appealed to categoricity arguments in a surprisingly varied range of contexts. One familiar example calls on second-order categoricity in an attempt to show that the Continuum Hypothesis, despite its…
The Theory of Functional Connections (TFC) is most often used for constraints over the field of real numbers. However, previous works have shown that it actually extends to arbitrary fields. The evidence for these claims is restricting…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
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…
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…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…
In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…
Dana Scott had shown that removing Extensionality from ZF set theory formalized in the customary manner would weaken it down to Zermelo set theory. The following proof is my personal attempt to solve the question of whether we can have a…
This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. A family Fc is called Frankl-complete (or FC-family) if in every…
Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation.…
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…