On Quantified Modal Logic

Article type: Research Article

Authors: Fitting, Melvin^;

Affiliations: Dept. Mathematics and Computer Science, Lehman College (CUNY), Bronx, NY 10468 | Depts. Computer Science, Philosophy, Mathematics, Graduate Center (CUNY), 33 West 42nd Street, NYC, NY 10036 [email protected]

Note: [] Address for correspondence: Dept. Mathematics and Computer Science, Lehman College (CUNY), Bronx, NY 10468

Abstract: Propositional modal logic is a standard tool in many disciplines, but first-order modal logic is not. There are several reasons for this, including multiplicity of versions and inadequate syntax. In this paper we sketch a syntax and semantics for a natural, well-behaved version of first-order modal logic, and show it copes easily with several familiar difficulties. And we provide tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.

DOI: 10.3233/FI-1999-391206

Journal: Fundamenta Informaticae, vol. 39, no. 1-2, pp. 105-121, 1999