On decidability of pure hybrid logic
نویسندگان
چکیده
منابع مشابه
A Hybrid Intuitionistic Logic: Semantics and Decidability
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic extended with disjunctive connectives. The extended logic can be seen as an instance of Hybrid IS5. ...
متن کاملOn Decidability of a Logic of Gossips
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other secrets, see, e.g., [11]. In [1], building upon [3], we studied distributed epistemic gossip protocols, which are examples of knowledge based programs introduced in [6]. These protocols use as guards formulas from a simple epistemic logic. We show here tha...
متن کاملDecidability of Context Logic
We consider the problem of decidability for Context Logic for sequences, ranked trees and unranked trees. We show how to translate quantifier-free formulae into finite automata that accept just the sequences or trees which satisfy the formulae. Satisfiability is thereby reduced to the language emptiness problem for finite automata, which is simply a question of reachability. This reduction show...
متن کاملDecidability of First - Order Logic
We study the problem of deciding satissability of rst order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research, due to their role in applications such as information integration and data warehousing. Our principal result is the identiication of an import...
متن کاملSequent logic of arithmetic decidability∗
Our paper continues, on the one hand, the study of modal logics that have arithmetical semantics, and on the other, the investigation of decidability (or “non-contingency”) logics. We present Hilbert-style axiomatic system for the non-contingency logic of the Gödel-Löb provability logic GL, in other words, for the logic that is complete under the interpretation of a formula BA as ‘a sentence A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2012
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.a.2012.16