Premium
QUANTIFIED MODAL LOGIC WITH NEIGHBORHOOD SEMANTICS
Author(s) -
Waagbø Geir,
Waagbø G.
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380144
Subject(s) - kripke semantics , modal logic , multimodal logic , s5 , kripke structure , completeness (order theory) , converse , semantics (computer science) , modal , normal modal logic , mathematics , well founded semantics , discrete mathematics , algebra over a field , operational semantics , computer science , theoretical computer science , pure mathematics , algorithm , programming language , denotational semantics , model checking , description logic , mathematical analysis , chemistry , geometry , polymer chemistry
The paper presents a semantics for quantified modal logic which has a weaker axiomatization than the usual Kripke semantics. In particular, the Barcan Formula (BF) and its converse are not valid with the proposed semantics. Subclasses of models which validate BF and other interesting formulas are presented. A completeness theorem is proved, and the relation between this result and completeness with respect to Kripke models is investigated.