Results 11 to 20 of about 935 (253)
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
Cut Elimination for Extended Sequent Calculi
Bulletin of the Section of Logic, 2023 We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +1 more source
Graphical Sequent Calculi for Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs.
Minghui Ma, Ahti-Veikko Pietarinen
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
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
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
Generic Modal Cut Elimination Applied to Conditional Logics [PDF]
Logical Methods in Computer Science, 2011 We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
Dirk Pattinson, Lutz Schröder
doaj +1 more source
Mathematical Text Processing in EA-style: a Sequent Aspect
Journal of Formalized Reasoning, 2016 The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order theories that ...
Alexander Lyaletski
doaj +1 more source
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj +1 more source