中文
相关论文

相关论文: A Normalizing Intuitionistic Set Theory with Inacc…

200 篇论文

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…

逻辑 · 数学 2022-09-19 Joel David Hamkins

According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…

逻辑 · 数学 2024-04-09 Joel David Hamkins

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…

逻辑 · 数学 2019-05-14 Robert Passmann

We investigate different set-theoretic constructions in Residuated Logic based on Fitting's work on Intuitionistic Set Theory. We start by stating some results concerning constructible sets within valued models of Set Theory. We present two…

逻辑 · 数学 2023-06-05 Jose Moncayo , Pedro H. Zambrano

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Arnon Avron , Liron Cohen

This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…

逻辑 · 数学 2007-12-17 Kenny Easwaran

A hallmark of human cognition is the ability to continually acquire and distill observations of the world into meaningful, predictive theories. In this paper we present a new mechanism for logical theory acquisition which takes a set of…

人工智能 · 计算机科学 2018-09-14 Andres Campero , Aldo Pareja , Tim Klinger , Josh Tenenbaum , Sebastian Riedel

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

逻辑 · 数学 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

逻辑 · 数学 2014-02-14 Joel David Hamkins

We explore an application of homological algebra to set theoretic objects by developing a cohomology theory for Hausdorff gaps. The cohomology theory is introduced with enough generality to be applicable to other questions in set theory.…

逻辑 · 数学 2016-09-06 Daniel Talayco

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

计算机科学中的逻辑 · 计算机科学 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski

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…

逻辑 · 数学 2023-10-18 Yurii Khomskii , Hrafn Valtýr Oddsson

In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…

计算机科学中的逻辑 · 计算机科学 2024-02-14 Samuele Maschio , Alexandre Miquel

In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…

范畴论 · 数学 2016-01-12 Vladimir Voevodsky

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

逻辑 · 数学 2025-10-03 Łukasz Kamiński

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…

逻辑 · 数学 2022-02-07 Andrew Swan

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…

逻辑 · 数学 2008-07-29 Werner DePauli-Schimanovich

We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…

逻辑 · 数学 2020-02-06 Alfredo Roque Freire

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

逻辑 · 数学 2022-03-11 Ali Enayat

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…

逻辑 · 数学 2023-09-27 Richard Matthews , Michael Rathjen