First-Order Modal Logic with an 'Actually' Operator
نویسندگان
چکیده
منابع مشابه
On the Expressivity of First-Order Modal Logic with "Actually"
Many authors have noted that a number of Englishmodal sentences cannot be formalized into standard first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyonewho’s actually rich could have been poor.” In response, many authors have introduced an “actually” operator@ into the language of first-order modal logic. It is...
متن کاملFirst-Order Classical Modal Logic
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness...
متن کاملLecture Notes on First-Order Reductions of First-Order Modal Logic 15-816: Modal Logic
First-order modal logic is clearly more than classical first-order logic, because modalities can be used to phrase more advanced necessity and possibility properties. At the same time, first-order modal logic and non-modal first-order logic are not entirely different either. Modalities quantify over all ( ) or some (♦) worlds. Quantifiers also quantify over all (∀) or some (∃) objects (yet not ...
متن کاملTopological Completeness of First-order Modal Logic
As McKinsey and Tarski [19] showed, the Stone representation theorem for Boolean algebras extends to algebras with operators to give topological semantics for (classical) propositional modal logic, in which the “necessity” operation is modeled by taking the interior of an arbitrary subset of a topological space. The topological interpretation was extended by Awodey and Kishida [3] in a natural ...
متن کاملHOL Based First-Order Modal Logic Provers
First-order modal logics (FMLs) can be modeled as natural fragments of classical higher-order logic (HOL). The FMLtoHOL tool exploits this fact and it enables the application of off-the-shelf HOL provers and model finders for reasoning within FMLs. The tool bridges between the qmf-syntax for FML and the TPTP thf0-syntax for HOL. It currently supports logics K, K4, D, D4, T, S4, and S5 with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2005
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1134397658