Sciweavers

6 search results - page 1 / 2
» Hypersequent Systems for the Admissible Rules of Modal and I...
Sort
View
LFCS
2009
Springer
13 years 10 months ago
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
Rosalie Iemhoff, George Metcalfe
TABLEAUX
2009
Springer
13 years 10 months ago
Modular Sequent Systems for Modal Logic
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
Kai Brünnler, Lutz Straßburger
AML
2007
95views more  AML 2007»
13 years 3 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
ENTCS
2010
119views more  ENTCS 2010»
13 years 3 months ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
APAL
2006
107views more  APAL 2006»
13 years 3 months ago
Frege systems for extensible modal logics
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Emil Jerábek