English
Related papers

Related papers: An equiconsistency proof for $\mathrm{CZF} + V = L…

200 papers

We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…

Logic · Mathematics 2021-09-24 Saharon Shelah

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…

Logic in Computer Science · Computer Science 2014-05-23 Antti Valmari

We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…

Logic · Mathematics 2024-10-29 Sakaé Fuchino

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

Logic · Mathematics 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…

Logic · Mathematics 2020-08-13 Balthasar Grabmayr

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

Logic · Mathematics 2015-07-01 Jean-Louis Krivine

In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…

Logic · Mathematics 2019-08-08 Arieh Lev

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

Logic · Mathematics 2025-09-05 Nicolás Sevilla Simón

In an earlier paper, "Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem" (math/0206302), I argued that a constructive interpretation of Goedel's reasoning establishes any formal system of…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

In this note we show that Voevodsky's univalence axiom holds in the model of type theory based on symmetric cubical sets. We will also discuss Swan's construction of the identity type in this variation of cubical sets. This proves that we…

Logic · Mathematics 2017-10-31 Marc Bezem , Thierry Coquand , Simon Huber

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

Logic in Computer Science · Computer Science 2020-05-29 Ciarán Dunne , J. B. Wells , Fairouz Kamareddine

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Logic · Mathematics 2025-09-15 Juan Pablo Aguilera , Joan Bagaria , Gabriel Goldberg , Philipp Lücke

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , Boban Velickovic

Set Matrix Theory (SMT) has been introduced in Log. Anal. 225: 59-82 (2014) as a generalization of ZF, in which matrices constructed from sets are treated as urelements, that is, as objects that are not sets but that can be elements of…

Logic · Mathematics 2024-12-16 Marcoen J. T. F. Cabbolet

We show that the Axiom of Real Determinacy $\mathsf{AD}_{\mathbb{R}}$ and the Axiom of Real Blackwell Determinacy $\mathsf{Bl}\text{-}\mathsf{AD}_{\mathbb{R}}$ are equivalent in $\mathsf{ZF}$+$\mathsf{DC}$. This answers the question of…

Logic · Mathematics 2026-03-18 Daisuke Ikegami , W. Hugh Woodin

This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…

Logic · Mathematics 2021-02-19 Gabriel Goldberg

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen