English
Related papers

Related papers: Modal-type orthomodular logic

200 papers

One of the proposed solutions for improving the scalability of semantics of programming languages is Component-Based Semantics, introduced by Peter D. Mosses. It is expected that this framework can also be used effectively for modular meta…

Logic in Computer Science · Computer Science 2011-08-17 Ken Madlener , Sjaak Smetsers , Marko van Eekelen

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

Logic in Computer Science · Computer Science 2025-07-15 Sonia Marin , Paaras Padhiar

We introduce syntactic modal operator $\BOX$ for \textit{being a thesis} into first-order logic. This logic is a modern realization of R. Carnap's old ideas on modality, as logical necessity (J. Symb. Logic, 1946) \cite{Ca46}. We place it…

Logic · Mathematics 2024-06-26 Marcin Łyczak

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we…

Logic · Mathematics 2025-12-01 Marta Bílková , Thomas M. Ferguson , Daniil Kozhemiachenko

We consider a quantified version of the (propositional) modal logic $\mathsf{BK}$, proposed earlier by S. P. Odintsov and H. Wansing; this version will be denoted by $\mathsf{QBK}$. Using the canonical model method, we prove the strong…

Logic · Mathematics 2022-01-14 Alexander V. Grefenstejn

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…

Logic in Computer Science · Computer Science 2019-03-14 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

It is a classic result in modal logic that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous.…

General Topology · Mathematics 2020-08-14 Guram Bezhanishvili , Luca Carai , Patrick Morandi

This article develops a novel framework for modal logic based on the idea of stratified actualization, rather than the classical model of global possible worlds. Traditional Kripke semantics treat modal operators as quantification over…

Logic in Computer Science · Computer Science 2025-06-24 Alexandre Le Nepvou

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

The paper treats 4 different fragments of first-order logic induced by their respective versions of Kripke style semantics for modal intuitionistic logic. In order to capture these fragments, the notion of asimulation is modified and…

Logic · Mathematics 2018-02-01 Grigory Olkhovikov

We study expansions of Hilbert spaces with a bounded normal operator $T$. We axiomatize this theory in a natural language and identify all of its completions. We prove the definability of the adjoint $T^*$ and prove quantifier elimination…

Logic · Mathematics 2025-07-30 Alexander Berenstein , Nicolás Cuervo Ovalle , Isaac Goldbring

A non-distributive two-sorted hypersequent calculus \textbf{PDBL} and its modal extension \textbf{MPDBL} are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational…

Logic · Mathematics 2022-07-25 Prosenjit Howlader , Mohua Banerjee

I aim to promote an alternative agenda for teaching modal logic chiefly inspired by the relationships between modal logic and philosophy. The guiding idea for this proposal is a reappraisal of the interest of modal logic in philosophy,…

History and Overview · Mathematics 2015-07-19 Luis Urtubey

In this article we study support $\tau$-tilting modules, semibricks and more over blocks of group algebras. Let $k$ be an algebraically closed field of characteristic $p>0$, $\tilde{G}$ a finite group and $G$ a normal subgroup of…

Representation Theory · Mathematics 2022-09-15 Ryotaro Koshio , Yuta Kozakai

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer