English
Related papers

Related papers: Implicit Kripke Semantics and Ultraproducts in Str…

200 papers

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

Logic · Mathematics 2023-07-19 Martin Otto

We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called light logics), from an abstract point of view, introducing a logical system in which…

Logic in Computer Science · Computer Science 2015-09-04 Pierre Boudes , Damiano Mazza , Lorenzo Tortora de Falco

Several logical operators are defined as dual pairs, in different types of logics. Such dual pairs of operators also occur in other algebraic theories, such as mathematical morphology. Based on this observation, this paper proposes to…

Logic in Computer Science · Computer Science 2017-10-17 Marc Aiguier , Isabelle Bloch

In this paper, we advocate the use of stratified logical theories for representing probabilistic models. We argue that such encodings can be more interpretable than those obtained in existing frameworks such as Markov logic networks. Among…

Artificial Intelligence · Computer Science 2016-11-21 Ondrej Kuzelka , Jesse Davis , Steven Schockaert

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many…

Logic in Computer Science · Computer Science 2025-12-01 Yuanzhe Yang

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

This is a short survey on the development of the formal specification and verification language H with emphasis on the scientific part. H is a modern highly expressive language solidly based upon advanced mathematical theories such as the…

Logic · Mathematics 2019-08-28 Răzvan Diaconescu

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

This paper presents a novel possible worlds semantics, designed to elucidate the underpinnings of ultrafinitism. By constructing a careful modification of the well-known Kripke models for inuitionistic logic, we seek to extend our…

Logic · Mathematics 2023-12-01 Mirco A. Mannucci

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

We introduce a modal logic for describing statistical knowledge, which we call statistical epistemic logic. We propose a Kripke model dealing with probability distributions and stochastic assignments, and show a stochastic semantics for the…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

Logic · Mathematics 2026-05-15 Amanda Vidal

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational…

Logic in Computer Science · Computer Science 2007-05-23 Roberto Bruni , Ugo Montanari , Francesca Rossi

We introduce stratified labelings as a novel semantical approach to abstract argumentation frameworks. Compared to standard labelings, stratified labelings provide a more fine-grained assessment of the controversiality of arguments using…

Artificial Intelligence · Computer Science 2013-08-06 Matthias Thimm , Gabriele Kern-Isberner

We continue work of our earlier paper (Lewitzka and Brunner: Minimally generated abstract logics, Logica Universalis 3(2), 2009), where abstract logics and particularly intuitionistic abstract logics are studied. Abstract logics can be…

Logic in Computer Science · Computer Science 2017-04-04 Andreas B. M. Brunner , Steffen Lewitzka