Electronic Notes in Theoretical Computer Science · 2010 · 26 citations · 16 references
ComputingComputer ScienceMathematicsFormal MethodsKnowledge RepresentationLogicAdmissibility RulesDeductive ReasoningModal LogicModal SemanticsModel CheckingModel TheoryAdmissible RulesAxiomatic SemanticsRule-based SystemsTableau Algorithms
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 modal logic S4. Our method is based on a standard semantic ground tableau approach. In particular, we reduce rule admissibility in S4 to satisfiability of a formula in a logic that extends S4. The extended logic is characterised by a class of models that satisfy a variant of the co-cover property. The class of models can be formalised by a well-defined first-order specification. Using a recently introduced framework for synthesising tableau decision procedures this can be turned into a sound, complete and terminating tableau calculus for the extended logic, and gives a tableau-based method for determining the admissibility of rules.
16
One hundred and two problems in mathematical logic
Harvey Friedman · Journal of Symbolic Logic · 1975 · 221 citations
Humanities, Mathematics, Logic +10
Unification in intuitionistic logic
Silvio Ghilardi · Journal of Symbolic Logic · 1999 · 179 citations
Silvio Ghilardi · Annals of Pure and Applied Logic · 2000 · 125 citations