Neighborhood-Sheaf Semantics for First-Order Modal Logic
نویسندگان
چکیده
منابع مشابه
Topos Semantics for Higher-Order Modal Logic
We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E . In contrast to the wellknown interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE , but rather by a suitable complete Heyting algebra H . The canonical map relating H and ΩE both serves to interpret equality and provides a modal...
متن کامل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 ...
متن کاملA Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from ...
متن کاملGame semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot’s lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine’s classical realizability and applications to type isomorphisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2011
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.10.011