On Quantified Modal Logic

Authors:
Melvin Fitting
Affiliations:
(Correspd.) Dept. Mathematics and Computer Science, Lehman College (CUNY), Bronx, NY 10468 and Depts. Computer Science, Philosophy, Mathematics, Graduate Center (CUNY), 33 West 42nd Street, NYC, N ...
Venue:
Fundamenta Informaticae
Year:
1999

Citing 4
Cited 0

Basic modal logic

Handbook of logic in artificial intelligence and logic programming (vol. 1)
First-order modal logic

First-order modal logic
Bertrand Russell, Herbrand's Theorem, and the Assignment Statement

AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
A Modal Herbrand Theorem

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.