Results 21 to 30 of about 715 (255)
Dual-Context Calculi for Modal Logic [PDF]
Logical Methods in Computer Science, 2020 We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of assumptions, one of which
G. A. Kavvos
doaj +1 more source
A derivation-loop method for temporal logic
Lietuvos Matematikos Rinkinys, 2019 Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature.
Romas Alonderis, Haroldas Giedra
doaj +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.
Leonardo B. Vana +2 more
openaire +1 more source
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
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
Sequent calculi for induction and infinite descent [PDF]
Journal of Logic and Computation, 2010 The authors develop and compare proof-theoretic foundations for proof by induction and proof by infinite descent in the context of a first-order logic \(\text{FOL}_{\text{ID}}\) containing inductively defined predicates. These two styles of reasoning are formalized as the corresponding sequent calculi. It is shown that the proof system \(\text{LKID}\),
Brotherston, James, Simpson, Alexander
openaire +3 more sources
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
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 +2 more sources
Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]
Computer Science Journal of Moldova, 2015 The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj