Tangled Type Theory was introduced by Randall Holmes in [3] as a new way of approaching the consistency problem for $\mathrm {NF}$. Although the task of finding models for this theory is far from trivial (considering it is equiconsistent with $\mathrm {NF}$ ), ways of constructing models for certain fragments of it have been discovered. In this article, we present a simpler way of constructing models of predicative Tangled Type Theory and consequently of predicative $\mathrm {NF}$. In these new models (...) of predicative $\mathrm {NF}$, the universe is well-orderable and equinumerous to the set of singletons. (shrink)

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including $\mathsf {PA}$ [39], $\mathsf {ZF}$, $\mathsf {Z}_2$, and $\mathsf {KM}$ [6]. In this article we extend Enayat’s investigations to subsystems of these latter two theories. We prove that restricting the Comprehension schema of $\mathsf {Z}_2$ and $\mathsf {KM}$ gives non-tight theories. Specifically, we show that $\mathsf {GB}$ and $\mathsf {ACA}_0$ each admit different bi-interpretable extensions, (...) and the same holds for their extensions by adding $\Sigma ^1_k$ -Comprehension, for $k \ge 1$. These results provide evidence that tightness characterizes $\mathsf {Z}_2$ and $\mathsf {KM}$ in a minimal way. (shrink)

We explain and explore class-theoretic potentialism—the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning the relevant potentialist systems (in particular exhibiting failures of the $\mathsf {.2}$ and $\mathsf {.3}$ axioms). We then discuss the significance of these results for the different kinds of class-theoretic potentialists.

The theory New Foundations of Quine was introduced in [14]. This theory is finitely axiomatizable as it has been proved in [9]. A similar result is shown in [8] using a system called K. Particular subsystems of NF, inspired by [8] and [9], have models in ZF. Very little is known about subsystems of NF satisfying typical properties of ZF; for example in [11] it is shown that the existence of some sets which appear naturally in ZF is an axiom (...) independent from NF . Here we discuss a model of subsystems of NF in which there is a set which is a model of ZF. MSC: 03E70. (shrink)

Zermelo’s Theorem that the axiom of choice is equivalent to the principle that every set can be well-ordered goes through in third-order logic, but in second-order logic we run into expressivity issues. In this note, we show that in a natural extension of second-order logic weaker than third-order logic, choice still implies the well-ordering principle. Moreover, this extended second-order logic with choice is conservative over ordinary second-order logic with the well-ordering principle. We also discuss a variant choice principle, due to (...) Hilbert and Ackermann, which neither implies nor is implied by the well-ordering principle. (shrink)

The technique of forcing is almost ubiquitous in set theory, and it seems to be based on technicalities like the concepts of genericity, forcing names and their evaluations, and on the recursively defined forcing predicates, the definition of which is particularly intricate for the basic case of atomic first order formulas. In his [3], the first author has provided an axiomatic framework for set forcing over models of $\mathrm {ZFC}$ that is a collection of guiding principles for extensions over which (...) one still has control from the ground model, and has shown that these axiomatics necessarily lead to the usual concepts of genericity and of forcing extensions, and also that one can infer from them the usual recursive definition of forcing predicates. In this paper, we present a more general such approach, covering both class forcing and set forcing, over various base theories, and we provide additional details regarding the formal setting that was outlined in [3]. (shrink)

In this paper, we give an axiomatization of the ordinal number system, in the style of Dedekind’s axiomatization of the natural number system. The latter is based on a structure $(N,0,s)$ consisting of a set N, a distinguished element $0\in N$ and a function $s\colon N\to N$. The structure in our axiomatization is a triple $(O,L,s)$, where O is a class, L is a class function defined on all s-closed ‘subsets’ of O, and s is a class function $s\colon O\to (...) O$. In fact, we develop the theory relative to a Grothendieck-style universe (minus the power set axiom), as a way of bringing the natural and the ordinal cases under one framework. We also establish a universal property for the ordinal number system, analogous to the well-known universal property for the natural number system. (shrink)

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially different universes of such sets. The unisets of the first universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular multisets and arbitrary trees. RID=""ID="" Mathematics Subject Classification (2000): 03B45, 03E65, 03E70, 18A15, (...) 18A22, 18B05, 68Q85 RID=""ID="" Key words or phrases: Multiset – Non-wellfounded set – Scott-universe – AFA – Coalgebra – Modal logic – Graded modalities. (shrink)

In this paper we define the forcing relation and prove its basic properties in the context of the theory ZFCA, i.e., ZFC minus the Foundation axiom and plus the Anti-Foundation axiom.

Quantum set theory and topos quantum theory are two long running projects in the mathematical foundations of quantum mechanics that share a great deal of conceptual and technical affinity. Most pertinently, both approaches attempt to resolve some of the conceptual difficulties surrounding QM by reformulating parts of the theory inside of nonclassical mathematical universes, albeit with very different internal logics. We call such mathematical universes, together with those mathematical and logical structures within them that are pertinent to the physical interpretation, (...) ‘Q-worlds’. Here, we provide a unifying framework that allows us to better understand the relationship between different Q-worlds, and define a general method for transferring concepts and results between TQT and QST, thereby significantly increasing the expressive power of both approaches. Along the way, we develop a novel connection to paraconsistent logic and introduce a new class of structures that have significant implications for recent work on paraconsistent set theory. (shrink)

The present note was prompted by Weber’s approach to proving Cantor’s theorem, i.e., the claim that the cardinality of the power set of a set is always greater than that of the set itself. While I do not contest that his proof succeeds, my point is that he neglects the possibility that by similar methods it can be shown also that no non-empty set satisfies Cantor’s theorem. In this paper unrestricted abstraction based on a cut free Gentzen type sequential calculus (...) will be employed to prove both results. In view of the connection between Priest’s three-valued logic of paradox and cut free Gentzen calculi this, a fortiori, has an impact on any paraconsistent set theory built on Priest’s logic of paradox. (shrink)

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to (...) reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ${\mathrm {ZFC}}$ to enable the development of interesting mathematics. We propose an axiomatic system ${\mathrm {BZFC}}$, obtained by analysing the ${\mathrm {ZFC}}$ -axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set. Our theory is naturally bi-interpretable with ${\mathrm {ZFC}}$, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1]. Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory. (shrink)

In this article we study the systems KF and VF of truth over set theory as well as related systems and compare them with the corresponding systems over arithmetic.

We introduce a quite natural Frege-style set theory, which we call Strong-Frege-2 equation image, a sort of simplification of the theory considered in 13 and 1 . We give a model of a weaker variant of equation image, called equation image, where atoms and coatoms are allowed. To construct the model we use an enumeration “almost without repetitions” of the Π11 sets of natural numbers; such an enumeration can be obtained via a classical priority argument much in the style of (...) 5 and 15. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)