中文
相关论文

相关论文: A Cut-free Sequent Calculus for Bi-Intuitionistic …

200 篇论文

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

计算机科学中的逻辑 · 计算机科学 2011-01-31 Luís Pinto , Tarmo Uustalu

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic…

计算机科学中的逻辑 · 计算机科学 2020-10-01 Sara Ayhan

We consider an extension of bi-intuitionistic logic with the traditional modalities from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with…

计算机科学中的逻辑 · 计算机科学 2010-06-30 Rajeev Gore , Linda Postniece , Alwen Tiu

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…

计算机科学中的逻辑 · 计算机科学 2013-07-19 Ranald Clouston , Jeremy Dawson , Rajeev Gore , Alwen Tiu

As part of a broader family of logics, [1, 3] introduced two key logical systems: $\mathsf{iK_{d}}$, which encapsulates the basic logical structure of dynamic topological systems, and $\mathsf{iK_{d*}}$, which provides a well-behaved yet…

We present the logic IBV, which is an intuitionistic version of BV, in the sense that its restriction to the MLL connectives is exactly IMLL, the intuitionistic version of MLL. For this logic we give a deep inference proof system and show…

计算机科学中的逻辑 · 计算机科学 2026-04-27 Matteo Acclavio , Lutz Strassburger

It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…

计算机科学中的逻辑 · 计算机科学 2024-11-20 Tim S. Lyon , Ian Shillito , Alwen Tiu

Since the discovery of critical mistakes in Rauszer's work on bi-intuitionistic logics, solid foundations for these have progressively been rebuilt. However, the algebraic treatment of these logics has not yet been tended to. We fill this…

逻辑 · 数学 2025-03-24 Jonte Deakin , Ian Shillito

We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of this logic and propose a bi-nested calculus for it. The…

计算机科学中的逻辑 · 计算机科学 2023-09-13 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}_\Box$: a terminating sequent calculus ${\sf G4iSL}_\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional…

逻辑 · 数学 2023-03-07 Iris van der Giessen , Rosalie Iemhoff

We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…

计算机科学中的逻辑 · 计算机科学 2026-02-06 Guillaume Geoffroy

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

计算机科学中的逻辑 · 计算机科学 2017-03-08 Katsuhiko Sano , John G. Stell

We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…

逻辑 · 数学 2016-11-15 Giuseppe Greco , Alessandra Palmigiano

In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower-Heyting-Kolmogorov and Kripke semantics for the logics of intuitionistic belief and knowledge. Subsequently Krupski has proved that the logic of…

逻辑 · 数学 2021-03-08 Guido Fiorino

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…

计算机科学中的逻辑 · 计算机科学 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin

The logic of bunched implications (BI) is a substructural logic that forms the backbone of separation logic, the much studied logic for reasoning about heap-manipulating programs. Although the proof theory and metatheory of BI are…

计算机科学中的逻辑 · 计算机科学 2021-12-13 Dan Frumin

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

计算机科学中的逻辑 · 计算机科学 2025-12-04 Tim S. Lyon

We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of…

计算机科学中的逻辑 · 计算机科学 2020-02-10 Sven Linker

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.

逻辑 · 数学 2009-05-12 Karim Nour , Olivier Laurent

The formal system of intuitionistic epistemic logic IEL was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Hayting-Kolmogorov…

计算机科学中的逻辑 · 计算机科学 2015-09-01 Vladimir N. Krupski , Alexey Yatmanov
‹ 上一页 1 2 3 10 下一页 ›