Results 11 to 20 of about 5,727 (317)

Generic Modal Cut Elimination Applied to Conditional Logics [PDF]

open access: yesLogical 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   +3 more sources

Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics [PDF]

open access: green, 2002
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L ...
George Metcalfe   +2 more
openalex   +4 more sources

Graphical Sequent Calculi for Modal Logics [PDF]

open access: yesElectronic 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   +4 more sources

Sequent Calculi with procedure calls

open access: green, 2013
In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision procedure for some background theory T, and the possibility to polarise literals "on the fly" during proof-search ...
Mahfuza Farooque   +1 more
  +6 more sources

Two complete finitary sequent calculi for reflexive common knowledge

open access: diamondLietuvos 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   +2 more sources

From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic [PDF]

open access: greenInformation Processing and Management of Uncertainty in Knowledge-Based Systems18th International Conference, 2020
Fermüller C, Lang T, Pavlova A.
europepmc   +3 more sources

Admissible Substitutions in Sequent Calculi [PDF]

open access: yes, 2003
For first-order classical logic a new notion of admissible substitution is defined. This notion allows optimizing the procedure of the application of quantifier rules when logical inference search is made in sequent calculi.
Lyaletski, Alexander
core   +2 more sources

Sequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented.
Marcelo E. Coniglio, María I. Corbalán
doaj   +1 more source

Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj   +1 more source

Home - About - Disclaimer - Privacy