论文信息 - Shakespearian Modal Logic: A Labelled Treatment of Modal Identity

Shakespearian Modal Logic: A Labelled Treatment of Modal Identity

In this paper we describe a modal proof system arising from the combination of a tableau-like classical system, which incorporates a restricted ("analytical") version of the cut rule, with a label formalism which allows for a specialised, logic dependant unification algorithm. The system provides a uniform proof-theoretical treatment of first-order (normal) modal logics with identity, with and without Barcan formula and/or its converse.

Guido Governatori | Antonino Rotolo | Paola Benassi | Alberto Artosi

[1] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[2] M. Fitting. Proof Methods for Modal and Intuitionistic Logics , 1983 .

[3] George Boolos,et al. Don't eliminate cut , 1984, J. Philos. Log..

[4] Guido Governatori. Labelled Tableaux for Multi-Modal Logics , 1995, TABLEAUX.

[5] Jaakko Hintikka,et al. Existential Presuppositions and Uniqueness Presuppositions , 1970 .

[6] Raymond M. Smullyan,et al. Analytic cut , 1969, Journal of Symbolic Logic (JSL).

[7] Lincoln A. Wallen,et al. Automated deduction in nonclassical logics , 1990 .

[8] Melvin Fitting,et al. Basic modal logic , 1993 .

[9] Patrice Enjalbert,et al. Modal Theorem Proving: An Equational Viewpoint , 1989, IJCAI.

[10] Dov M. Gabbay,et al. Classical vs non-classical logics (the universality of classical logic) , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[11] Guido Governatori,et al. Labelled Proofs for Quantified Modal Logic , 1996, JELIA.

[12] G. E. Hughes,et al. An introduction to modal logic, 2e éd., 1 vol , 1973 .

[13] Guido Governatori. A Duplication and Loop Checking Free System for S4 , 1996 .

[14] Dov M. Gabbay,et al. Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[15] Martín Abadi,et al. Modal Theorem Proving , 1986, CADE.