English
Related papers

Related papers: Kripke Contexts, Double Boolean Algebras with Oper…

200 papers

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…

Logic in Computer Science · Computer Science 2025-12-10 Tatiana Yavorskaya , Elena Popova

A formalism for the study of highly interacting electronic systems is presented. The proposed scheme is based on two key concepts: composite operators and algebra constraints. Composite field operators, that naturally appear as a…

Strongly Correlated Electrons · Physics 2009-11-10 Ferdinando Mancini

We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…

A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always…

Logic · Mathematics 2020-07-24 Arun Kumar , Mohua Banerjee

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Logic · Mathematics 2023-11-17 Adam Přenosil

Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/worlds -- maximal consistent sets of propositions -- with…

Logic · Mathematics 2016-10-18 Sergei Artemov

In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…

Logic · Mathematics 2026-04-29 Haruka Kogure , Taishi Kurahashi

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

It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only if the context contains an n-dimensional contra-nominal scale as subcontext. In this work, we investigate more closely the interplay between the…

Discrete Mathematics · Computer Science 2021-04-16 Maren Koyda , Gerd Stumme

The paper describes an algorithm for semantic representation of behavioral contexts relative to a dichotomic decision alternative. The contexts are represented as quantum qubit states in two-dimensional Hilbert space visualized as points on…

Neurons and Cognition · Quantitative Biology 2020-12-23 Ilya A. Surov

We investigate a simply typed modal $\lambda$-calculus, $\lambda^{\to\square}$, due to Pfenning, Wong and Davies, where we define a well-typed term with respect to a context stack that captures the possible world semantics in a syntactic…

Programming Languages · Computer Science 2023-06-22 Jason Z. S. Hu , Brigitte Pientka

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…

Logic in Computer Science · Computer Science 2015-09-25 Lauri Hella , Johanna Stumpf

We propose a novel database model whose basic structure is a labeled, directed, acyclic graph with a single root, in which the nodes represent the data sets of an application and the edges represent functional relationships among the data…

Databases · Computer Science 2024-07-01 Nicolas Spyratos

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

The primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We first review the category of relations and categories of Kripke frames, with…

Logic in Computer Science · Computer Science 2017-07-28 Kohei Kishida

We provide a generalisation of Kripke semantics for Petr Hajek's Basic Logic and prove soundness and completeness of the same with respect to our semantics. We find this semantics easily specialises to the linearly-ordered Kripke frames for…

Logic in Computer Science · Computer Science 2023-08-10 Andrew Lewis-Smith

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

A qualgebra $G$ is a set having two binary operations that satisfy compatibility conditions which are modeled upon a group under conjugation and multiplication. We develop a homology theory for qualgebras and describe a classifying space…

Geometric Topology · Mathematics 2018-01-23 J. Scott Carter , Victoria Lebed , Seung Yeop Yang

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson