Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
A tableau-like proof procedure for normal modal logics
Theoretical Computer Science
Modal tableaux with propagation rules and structural rules
Fundamenta Informaticae
A Labelled Sequent System for Tense Logic Kt
AI '98 Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence
Labelled Tableaux for Multi-Modal Logics
TABLEAUX '95 Proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Free Variable Tableaux for Propositional Modal Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Cut-Free Display Calculi for Nominal Tense Logics
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Tableau Calculi for Hybrid Logics
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Improved Decision Procedures for the Modal Logics K, T, and S4
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Strongly Analytic Tableaux for Normal Modal Logics
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
The Nondeterministic Information Logic NIL is PSPACE-complete
Fundamenta Informaticae
Hi-index | 0.00 |
We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π10-formulae and Π20-formulae. The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cut-rule that is not eliminable. A nice computational property of the restriction is, for instance, that at any stage of the proof, only a finite number of potential cut-formulae needs to be taken under consideration. Although restrictions on the proof search (preserving completeness) are given in the paper and most of them are theoretically appealing, the use of those calculi for mechanization is however doubtful. Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics.