Results 21 to 30 of about 5,524 (273)
Sequent Calculi for Visser's Propositional Logics
Notre Dame Journal of Formal Logic, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsumasa Ishii +2 more
openaire +3 more sources
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents [PDF]
, 2019 We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-
Clouston, Ranald +3 more
core +3 more sources
Contraction-free calculi for modal logics S5 and KD45
Lietuvos Matematikos Rinkinys, 2011 It is known that termination and backtracking are among the most important problems in constructing derivations in non-classical logics. In this paper contractionfree and backtracking-free sequent calculi for modal logics S5 and KD45 are presented and ...
Julius Andrikonis +1 more
doaj +1 more source
Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics [PDF]
, 2019 This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics.
A Ciabattoni +15 more
core +2 more sources
, 2014 Display calculi are generalized sequent calculi which enjoy a `canonical' cut elimination strategy. That is, their cut elimination is uniformly obtained by verifying the assumptions of a meta-theorem, and is preserved by adding or removing structural rules.
Frittella, Sabine +4 more
openaire +5 more sources
Cut free sequent calculus for logic S5n(ED)
Lietuvos Matematikos Rinkinys, 2010 Hilbert style, Gentzen style sequent and Kanger style sequent calculi for logic S5n(ED) are considered in this paper. Gentzen style sequent calculus is constructed and its equivalence with Hilbert style system is proved, getting soundness and ...
Haroldas Giedra
doaj +1 more source
LNL polycategories and doctrines of linear logic [PDF]
Logical Methods in Computer Science, 2023 We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential comonads, LNL ...
Michael Shulman
doaj +1 more source
Simple Decision Procedure for S5 in Standard Cut-Free Sequent Calculus [PDF]
, 2016 In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e.
Indrzejczak, Andrzej
core +1 more source
Sequent Calculi for ‘Generally’
Electronic Notes in Theoretical Computer Science, 2008 AbstractLogics of ‘generally’ (LG's) were introduced for handling assertions with some versions of vague notions (e.g. ‘generally’, ‘most’, ‘several’), which occur often in ordinary language and in science. LG's provide a framework for distinct notions of ‘generally’: one builds a specific logic for the notion one has in mind.
Vana, Leonardo Bruno +2 more
openaire +1 more source
Two complete finitary sequent calculi for reflexive common knowledge
Lietuvos Matematikos Rinkinys, 2013 This paper discusses the use of complete sequent calculi for reflexive common knowledge logic. Description of language and complete infinitary calculus for RCL is presented.
Aurimas Paulius Girčys +1 more
doaj +1 more source