A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
While propositional modal logic is a standard tool, first-order modal logic is not. Indeed, it is not generally understood that conventional first-order syntax is insufficiently expressible. In this paper we sketch a natural syntax and semantics for first-order modal logic, and show how it easily copes with well-known problems. And we provide formal tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.doi:10.1007/bfb0055899 fatcat:h33duuw2ufcfpkzpo6o3v55fya