Related papers: The Axiom of Multiple Choice and Models for Constr…
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…
We define an ordinalized version of Kleene's realizability interpretation of intuitionistic logic by replacing Turing machines with Koepke's ordinal Turing machines (OTMs), thus obtaining a notion of realizability applying to arbitrary…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
Bishop's informal set theory is briefly discussed and compared to Lawvere's Elementary Theory of the Category of Sets (ETCS). We then present a constructive and predicative version of ETCS, whose standard model is based on the constructive…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…
A theorem, usually attributed to Barr, yields that (A) geometric implications deduced in classical L_{\infty\omega} logic from geometric theories also have intuitionistic proofs. Barr's theorem is of a topos-theoretic nature and its proof…
We give a framework to produce constructible functions from natural functors between categories, without need of a morphism of moduli spaces to model the functor. We show using the Riemann-Hilbert correspondence that any natural (derived)…
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…
We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…
We investigate the asymptotic densities of theorems provable in Zermelo-Fraenkel set theory ZF and its extension ZFC including the axiom of choice. Assuming a canonical De Bruijn representation of formulae, we construct asymptotically large…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…