English
Related papers

Related papers: Local Intuitionistic Modal Logics and Their Calcul…

200 papers

This article presents iALC, an intuitionistic version of the classical description logic ALC, based on the framework for constructive modal logics presented by Simpson \cite{simpson95} and related to description languages, via hybrid…

Logic in Computer Science · Computer Science 2014-02-04 Edward Hermann Haeusler , Alexandre Rademaker

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

Logic in Computer Science · Computer Science 2023-06-23 Eben Blaisdell

In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules we obtain linear nested sequent…

Logic in Computer Science · Computer Science 2017-11-17 Björn Lellmann , Elaine Pimentel

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Logic · Mathematics 2009-09-29 Kai Bruennler

We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…

Logic · Mathematics 2025-10-01 Arturo Rodriguez Fanlo , Ori Segel

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

Logic in Computer Science · Computer Science 2017-08-15 Ioannis Kokkinis

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu

We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

Fitch-style modal deduction, in which modalities are eliminated by opening a subordinate proof, and introduced by shutting one, were investigated in the 1990s as a basis for lambda calculi. We show that such calculi have good computational…

Logic in Computer Science · Computer Science 2018-01-22 Ranald Clouston

First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus. In addition to the fragment of MILL1 which corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show fragments…

Computation and Language · Computer Science 2013-05-28 Richard Moot

We prove that the category of vector bundles over a fixed smooth manifold and its corresponding category of convenient modules are models for intuitionistic differential linear logic. The exponential modality is modelled by composing the…

Logic in Computer Science · Computer Science 2021-02-10 James Wallbridge

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from…

Logic in Computer Science · Computer Science 2011-02-15 Sandra Alves , Maribel Fernández , Ian Mackie

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…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

In this note we discuss a variant of linear logic with idempotent exponential modalities. We propose a sequent calculus system and discuss its semantics. We also give a concrete relational model for this calculus.

Logic in Computer Science · Computer Science 2014-07-23 Sergey Slavnov

This paper establishes relative expressiveness results for several modal mu-calculi interpreted over timed automata. These mu-calculi combine modalities for expressing passage of (real) time with a general framework for defining formulas…

Logic in Computer Science · Computer Science 2025-08-08 Rance Cleaveland , Jeroen J. A. Keiren , Peter Fontana

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of…

Logic · Mathematics 2020-11-11 Ivano Ciardelli , Rosalie Iemhoff , Fan Yang

We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic…

Logic in Computer Science · Computer Science 2020-01-01 Philippe Balbiani , Joseph Boudou , Martín Diéguez , David Fernández-Duque
‹ Prev 1 3 4 5 6 7 10 Next ›