English
Related papers

Related papers: An intuitionistically complete system of basic int…

200 papers

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…

Logic · Mathematics 2016-07-12 Łukasz Czajka

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Logic · Mathematics 2023-11-17 Adam Přenosil

We investigate intuitionistic modal logics with locally interpreted $\square$ and $\lozenge$. The basic logic LIK is stronger than constructive modal logic WK and incomparable with intuitionistic modal logic IK. We propose an axiomatization…

Logic in Computer Science · Computer Science 2024-03-12 Philippe Balbiani , Han Gao , Çiğdem Gencer , Nicola Olivetti

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…

Logic · Mathematics 2007-05-23 Frederic Dambreville

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…

Logic in Computer Science · Computer Science 2025-12-10 Tatiana Yavorskaya , Elena Popova

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

This reports introduces a novel sound and complete semantics for first order intuitionistic logic, in the framework of category theory and by the computational interpretation of the logic based on the so-called Curry-Howard isomorphism.…

Logic · Mathematics 2013-07-02 Marco Benini

This paper introduces a natural deduction calculus for intuitionistic logic of belief $\mathsf{IEL}^{-}$ which is easily turned into a modal $\lambda$-calculus giving a computational semantics for deductions in $\mathsf{IEL}^{-}$. By using…

Logic · Mathematics 2020-12-16 Cosimo Perini Brogi

Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…

Logic · Mathematics 2025-07-18 Alexander V. Gheorghiu

Standard epistemic logics introduce a modal operator K to represent knowledge, but in doing so they presuppose the logical apparatus they aim to explain. By contrast, this paper explores how logic may be derived from the structure of…

Logic in Computer Science · Computer Science 2025-12-01 Alexader V. Gheorghiu , Tao Gu

Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language…

Logic · Mathematics 2018-12-19 Fan Yang

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

We revisit the duality between Kripke and algebraic semantics of intuitionistic and intuitionistic modal logic. We find that there is a certain mismatch between the two semantics, which means that not all algebraic models can be embedded…

Logic in Computer Science · Computer Science 2024-12-18 G. A. Kavvos

We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…

Logic in Computer Science · Computer Science 2023-09-04 Anupam Das , Iris van der Giessen , Sonia Marin

We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using…

Logic in Computer Science · Computer Science 2026-03-06 Sofía Santiago-Fernández , David Fernández-Duque , Joost J. Joosten

We introduce a semantics for epistemic logic exploiting a belief base abstraction. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and epistemic alternative are primitive, in the…

Computer Science and Game Theory · Computer Science 2019-07-23 Emiliano Lorini

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…

Logic · Mathematics 2016-09-07 Frederic Dambreville
‹ Prev 1 4 5 6 7 8 10 Next ›