Abstract
First-order modal logic, in the usual formulations, is not sufficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal logic: its formal semantics, and a proof procedure using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in Gödel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Bressan. A General Interpreted Modal Calculus. Yale University Press, 1972.
M. C. Fitting. Bertrand Russell, Herbrand’s theorem, and the assignment statement. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation, pages 14–28. Springer Lecture Notes in Artificial Intelligence, 1476, 1998.
M. C. Fitting and R. Mendelsohn. First-Order Modal Logic. Kluwer, 1998.
K. Gödel. Ontological proof. In S. Feferman, J. W. Dawson, Jr., W. Goldfarb, C. Parsons, and R. M. Solovay, editors, Kurt Gödel Collected Works, volume III, pages 403–404. Oxford, Oxford, 1995.
G. E. Hughes and M. J. Cresswell. A New Introduction to Modal Logic. Routledge, London, 1996.
D. Prawitz. Hauptsatz for higher order logic. Journal of Symbolic Logic, 33:452–457, 1968.
R. Stalnaker and R. Thomason. Abstraction in first-order modal logic. Theoria, 34:203–207, 1968.
M. Takahashi. A proof of cut-elimination theorem in simple type theory. J. Math. Soc. Japan, 19:399–410, 1967.
R. Thomason and R. Stalnaker. Modality and reference. Nous, 2:359–372, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fitting, M. (2000). Higher-Order Modal Logic—A Sketch. In: Caferra, R., Salzer, G. (eds) Automated Deduction in Classical and Non-Classical Logics. FTP 1998. Lecture Notes in Computer Science(), vol 1761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46508-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-46508-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67190-9
Online ISBN: 978-3-540-46508-9
eBook Packages: Springer Book Archive