中文
相关论文

相关论文: De Jongh's Theorem for Intuitionistic Zermelo-Frae…

200 篇论文

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…

逻辑 · 数学 2019-11-20 Takako Nemoto , Michael Rathjen

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…

逻辑 · 数学 2022-06-10 Robert Passmann

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

逻辑 · 数学 2024-12-02 Emanuele Frittaion , Takako Nemoto , Michael Rathjen

We show that the intuitionistic propositional logic with a Galois connection (IntGC), introduced by the authors, has the finite model property.

逻辑 · 数学 2014-03-26 Wojciech Dzik , Jouni Järvinen , Michiro Kondo

In "Extensional realizability for intuitionistic set theory", we introduced an extensional variant of generic realizability, where realizers act extensionally on realizers, and showed that this form of realizability provides "inner" models…

逻辑 · 数学 2024-12-10 Emanuele Frittaion

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…

计算机科学中的逻辑 · 计算机科学 2023-07-25 Ulrich Berger , Hideki Tsuiki

It is known that the set of tautologies of second order intuitionistic propositional logic, $\mathrm{IPC} 2$, is undecidable. Here, we prove that the sets of formulas of $\mathrm{IPC} 2$ which are true in the algebra of open subsets of…

逻辑 · 数学 2016-12-22 Konrad Zdanowski

We investigate the logical structure of intuitionistic Kripke-Platek set theory IKP, and show that the first-order logic of IKP is intuitionistic first-order logic IQC.

逻辑 · 数学 2021-06-10 Rosalie Iemhoff , Robert Passmann

We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most…

逻辑 · 数学 2022-12-27 Haotian Tong , Dag Westerståhl

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

逻辑 · 数学 2015-04-21 Richard Zach

We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…

逻辑 · 数学 2023-06-21 Grigory Olkhovikov

CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…

逻辑 · 数学 2011-02-23 Daniel Méhkeri

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

逻辑 · 数学 2018-12-19 Fan Yang , Jouko Väänänen

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…

逻辑 · 数学 2024-03-18 Merlin Carl

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

综合数学 · 数学 2007-05-23 Alexander Sakharov

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

计算机科学中的逻辑 · 计算机科学 2016-10-27 Emil Jeřábek

It is shown that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain topological property reminiscent of compactness, the Tarski union property and preservation under…

逻辑 · 数学 2020-11-11 Guillermo Badia , Grigory Olkhovikov

I show that propositional intuitionistic logic is complete with respect to an adaptation of Dummett's pragmatist justification procedure. In particular, given a pragmatist justification of an argument, I show how to obtain a natural…

逻辑 · 数学 2019-03-19 Hermógenes Oliveira

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

逻辑 · 数学 2020-12-22 Emanuele Frittaion , Michael Rathjen

We report our findings on the properties of Flagg and Friedman's translation from Epistemic into Intuitionistic logic, which was proposed as the basis of a comprehensive proof method for the faithfulness of the Goodel translation. We focus…

计算机科学中的逻辑 · 计算机科学 2015-11-24 Alessandro Provetti , Andrea Zucchellini
‹ 上一页 1 2 3 10 下一页 ›