The first-order logic of CZF is intuitionistic first-order logic

Journal of Symbolic Logic 89 (1):308-330 (2024)
  Copy   BIBTEX

Abstract

We prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics. On the way, we also show that the propositional admissible rules of CZF are exactly those of intuitionistic propositional logic.

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2022.51

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Logics of intuitionistic Kripke-Platek set theory.Rosalie Iemhoff & Robert Passmann - 2021 - Annals of Pure and Applied Logic 172 (10):103014.
Expressing Second-order Sentences in Intuitionistic Dependence Logic.Fan Yang - 2013 - Studia Logica 101 (2):323-342.
Intuitionistic completeness for first order classical logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Negationless intuitionism.Enrico Martino - 1998 - Journal of Philosophical Logic 27 (2):165-177.
Bi-Simulating in Bi-Intuitionistic Logic.Guillermo Badia - 2016 - Studia Logica 104 (5):1037-1050.
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic.Morten H. Sørensen & Paweł Urzyczyn - 2010 - Notre Dame Journal of Formal Logic 51 (4):457-473.
The undecidability of second order linear logic without exponentials.Yves Lafont - 1996 - Journal of Symbolic Logic 61 (2):541-548.
On the complexity of propositional quantification in intuitionistic logic.Philip Kremer - 1997 - Journal of Symbolic Logic 62 (2):529-544.
Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
A common axiom set for classical and intuitionistic plane geometry.Melinda Lombard & Richard Vesley - 1998 - Annals of Pure and Applied Logic 95 (1-3):229-255.
Satisfiability is False Intuitionistically: A Question from Dana Scott.Charles McCarty - 2020 - Studia Logica 108 (4):803-813.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
A secondary semantics for Second Order Intuitionistic Propositional Logic.Mauro Ferrari, Camillo Fiorentini & Guido Fiorino - 2004 - Mathematical Logic Quarterly 50 (2):202-210.
Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem.Victor N. Krivtsov - 2015 - Studia Logica 103 (3):623-638.

Analytics

Added to PP
2022-07-09

Downloads
34 (#469,582)

6 months
17 (#148,261)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Robert Passmann
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

Constructivism in Mathematics, An Introduction.A. Troelstra & D. Van Dalen - 1991 - Tijdschrift Voor Filosofie 53 (3):569-570.
Choice Implies Excluded Middle.N. Goodman & J. Myhill - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):461-461.
Foundations of Set Theory.A. A. Fraenkel, Y. Bar Hillel & A. Levy - 1975 - British Journal for the Philosophy of Science 26 (2):165-170.
Choice Implies Excluded Middle.N. Goodman & J. Myhill - 1978 - Mathematical Logic Quarterly 24 (25‐30):461-461.

View all 14 references / Add more references