Modal Logic via Global Consequence
نویسندگان
چکیده
In modal logic, semantic consequence is usually defined locally by truth preservation at all worlds in models (with respect to a class of frames). It can also be globally The latter called global consequence, which much less studied than the standard local one. this paper we first study relationship between and consequence. Then give some correspondence results for Finally, illustrate two applications connecting it with informational update proposed formal semantics. Some are already known, collected sake completeness. others appear new. We suggest that not only interesting theoretically, but useful applications.
منابع مشابه
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
This paper studies finitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness and decidability results. The logics are studied within the abstract framework of coalgebraic modal logic, which can be instantiated with arbitrary endofunctors on the category of sets. This is achieved through the use of predicate liftings, which generalise atomic p...
متن کاملGlobal vs. Local in Basic Modal Logic
We discuss results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
متن کاملGlobal Definability in Basic Modal Logic
We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
متن کاملModal Consequence Relations
Logic is generally defined as the science of reasoning. Mathematical logic is mainly concerned with forms of reasoning that lead from true premises to true conclusions. Thus we say that the argument from σ0;σ1; · · · ;σn−1 to δ is logically correct if whenever σi is true for all i < n, then so is δ. In place of ‘argument’ one also speaks of a ‘rule’ or an ‘inference’ and says that the rule is v...
متن کاملReducing Modal Consequence Relations
In this paper we will investigate the possibility of reducing derivability in a modal consequence relation to consistency in unimodal and polymodal K by means of so–called reduction functions. We will present new and easy methods to prove standard results on decidability, complexity, finite model property, interpolation and Halldén–completeness using only the reduction functions. Some new resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-88853-4_8