41 search results - page 1 / 9 » A Unified Completeness Theorem for Quantified Modal Logics |
41
Voted
JSYML
2002
14 years 9 months ago
2002
AML
2006
14 years 10 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
81
Voted
JANCL
2008
14 years 10 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
77
Voted
APAL
1999
14 years 9 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
79
Voted
JSYML
2002
14 years 9 months ago
2002
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...