Various modal logics seem well suited for developing models of knowledge, belief, time, change, causality, and other intensional concepts. Most such systems are related to the classical Lewis systems, and thereby have a substantial body of conventional proof theoretical results. However, most of the applied literature examines modal logics from a semantical point of view, rather than through proof theory. It appears arguments for validity are more clearly stated in terms of a semantical explanation, rather than a classical proof-theoretic one. We feel this is due to the inability of classical proof theories to adequately represent intensional aspects of modal semantics. This thesis develops proof theoretical methods which explicitly represent the underlying semantics of the modal formula in the proof. We initially develop a Gentzen style proof system which contains semantic information in the sequents. This system is, in turn, used to develop natural deduction proofs. Another semantic style proof representation, the modal expansion tree is developed. This structure can be used to derive either Gentzen style or Natural Deduction proofs. We then explore ways of automatically generating MET proofs, and prove sound and complete heuristics for that procedure. These results can be extended to most propositional system using a Kripke style semantics and a fist order theory of the possible worlds relation. Examples are presented for standard T, S4, and S5 systems, systems of knowledge and belief, and common knowledge. A computer program which implements the theory is briefly examined in the appendix. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-85-55. This technical report is available at ScholarlyCommons: https://repository.upenn.edu/cis_reports/658 COMPUTATIONAL ASPECTS OF PROOFS IN MODAL LOGIC Gregory Donald Hager MS-CIS-85-55 Department Of Computer and Information Science Moore School University of Pennsylvania Philadelphia, PA 191 04
[1]
M. Sato.
A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential Method
,
1977
.
[2]
Joseph Y. Halpern,et al.
A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft
,
1985,
IJCAI.
[3]
Dale A. Miller,et al.
Proofs in Higher-Order Logic
,
1983
.
[4]
Peter B. Andrews.
Refutations by Matings
,
1976,
IEEE Transactions on Computers.
[5]
Kosta Dosen,et al.
Sequent-systems for modal logic
,
1985,
Journal of Symbolic Logic.
[6]
Donald Michie,et al.
Machine Intelligence 4
,
1970
.
[7]
John McCarthy,et al.
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE
,
1987
.
[8]
Robert C. Moore.
Reasoning About Knowledge and Action
,
1977,
IJCAI.
[9]
Dale Miller,et al.
Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs
,
1984,
CADE.
[10]
Gerhard Gentzen,et al.
Investigations into Logical Deduction
,
1970
.
[11]
Robert C. Moore.
A Formal Theory of Knowledge and Action
,
1984
.
[12]
Kazuo Matsumoto,et al.
Gentzen method in modal calculi. II
,
1957
.
[13]
Max J. Cresswell,et al.
A companion to modal logic
,
1984
.
[14]
Charles G. Morgan,et al.
Methods for Automated Theorem Proving in Nonclassical Logics
,
1976,
IEEE Transactions on Computers.
[15]
M. E. Szabo,et al.
The collected papers of Gerhard Gentzen
,
1969
.
[16]
Peter B. Andrews.
Theorem Proving via General Matings
,
1981,
JACM.
[17]
G. G. Stokes.
"J."
,
1890,
The New Yale Book of Quotations.
[18]
Ronald Fagin,et al.
A Model-Theoretic Analysis of Knowledge: Preliminary Report
,
1984,
FOCS.
[19]
Max J. Cresswell,et al.
A New Introduction to Modal Logic
,
1998
.
[20]
K. Konolige.
A deduction model of belief and its logics
,
1984
.