English
Related papers

Related papers: Regular non-normal modal classicalities

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 establish sharp interior and boundary regularity estimates for solutions to $\partial_t u - L u = f(t, x)$ in $I\times \Omega$, with $I \subset \mathbb{R}$ and $\Omega \subset\mathbb{R}^n$. The operators $L$ we consider are…

Analysis of PDEs · Mathematics 2017-03-09 Xavier Fernández-Real , Xavier Ros-Oton

In static classical statistical systems the problem of information transport from a boundary to the bulk finds a simple description in terms of wave functions or density matrices. While the transfer matrix formalism is a type of Heisenberg…

Quantum Physics · Physics 2018-05-09 C. Wetterich

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2022-09-22 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingolfsdottir

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

Using the unbounded picture of analytical K-homology, we associate a well-defined K-homology class to an unbounded symmetric operator satisfying certain mild technical conditions. We also establish an ``addition formula'' for the Dirac…

K-Theory and Homology · Mathematics 2007-05-23 Hela Bettaieb , Michel Matthey , Alain Valette

Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…

Logic in Computer Science · Computer Science 2026-03-27 Luca Aceto , Antonis Achilleos , Aggeliki Chalki , Anna Ingolfsdottir

In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al. (2020) "Dynamic Term-modal Logics for First-order…

Logic in Computer Science · Computer Science 2025-01-03 Takahiro Sawasaki

We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over…

Logic · Mathematics 2021-12-22 Felix Canavoi , Martin Otto

We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…

Logic in Computer Science · Computer Science 2026-03-09 Roman Kontchakov , Dmitry Shkatov , Frank Wolter

We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a lattice-embedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic…

Quantum Physics · Physics 2017-02-08 Simon Kramer

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…

Artificial Intelligence · Computer Science 2013-12-24 Pedro Cabalar , Jorge Fandinno

This paper introduces LTLF, a temporal logic designed to express the frequency properties of event series in a natural but rigorous manner. By introducing novel, measure-sensitive operators, LTLF allows for the evaluation of frequencies and…

Logic in Computer Science · Computer Science 2026-05-29 Melissa Antonelli , Leonardo Ceragioli , Alessandro Giuseppe Buda , Giuseppe Primiero

We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5. This includes the constructive variants of the…

Logic in Computer Science · Computer Science 2017-01-11 Lutz Strassburger , Anupam Das , Ryuta Arisaka

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…

Dynamical Systems · Mathematics 2024-12-16 Ulrich Bauer , David Hien , Oliver Junge , Konstantin Mischaikow

Quantified modal logic provides a natural logical language for reasoning about modal attitudes even while retaining the richness of quantification for referring to predicates over domains. But then most fragments of the logic are…

Logic in Computer Science · Computer Science 2018-03-29 Anantha Padmanabha , R. Ramanujam , Yanjing Wang

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

Standard epistemic logics introduce a modal operator K to represent knowledge, but in doing so they presuppose the logical apparatus they aim to explain. By contrast, this paper explores how logic may be derived from the structure of…

Logic in Computer Science · Computer Science 2025-12-01 Alexader V. Gheorghiu , Tao Gu