English
Related papers

Related papers: Compatibility between modal operators in distribut…

200 papers

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped…

Logic · Mathematics 2026-02-04 Daniel Quigley

We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…

Logic · Mathematics 2025-08-13 Ryo Kashima , Taishi Kurahashi , Sohei Iwata , So Morioka

We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static…

Logic in Computer Science · Computer Science 2020-07-20 Bartosz Bednarczyk , Stéphane Demri , Raul Fervari , Alessio Mansutti

This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…

Logic · Mathematics 2024-04-25 Nino Guallart

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

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

The one-variable fragment of a first-order logic may be viewed as an "S5-like" modal logic, where the universal and existential quantifiers are replaced by box and diamond modalities, respectively. Axiomatizations of these modal logics have…

Logic · Mathematics 2024-11-20 Petr Cintula , George Metcalfe , Naomi Tokuda

We compute general compatibility conditions between a weakly nonlocal homogeneous Hamiltonian operator and a third-order homogeneous Hamiltonian operator. Such operators determine a bi-Hamiltonian structure for many integrable PDEs…

Exactly Solvable and Integrable Systems · Physics 2026-02-17 Paolo Lorenzoni , Stanislav Opanasenko , Raffaele Vitolo

We discuss conditionalisation for Accept-Desirability models in an abstract decision-making framework, where uncertain rewards live in a general linear space, and events are special projection operators on that linear space. This abstract…

Artificial Intelligence · Computer Science 2025-12-23 Kathelijne Coussement , Gert de Cooman , Keano De Vos

In this article we note that in a number of situations the operator product and the classical action satisfy a natural compatibility condition. We consider the interest of this condition to be twofold: First, the naturality (functoriality)…

High Energy Physics - Theory · Physics 2007-05-23 Olivier de Mirleau

We provide a method of translating theories of Nute's defeasible logic into logic programs, and a corresponding translation in the opposite direction. Under certain natural restrictions, the conclusions of defeasible theories under the…

Artificial Intelligence · Computer Science 2011-06-13 Frederick Maier

We formalise the modal operators from the concurrent dynamic logics of Peleg, Nerode and Wijesekera in a multirelational algebraic language based on relation algebra and power allegories, using relational approximation operators on…

Logic in Computer Science · Computer Science 2023-06-16 Hitoshi Furusawa , Walter Guttmann , Georg Struth

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

Characterizations of the star, minus and diamond orders of operators are given in various contexts and the relationship between these orders is made more transparent. Moreover, we introduce a new partial order of operators which provides a…

Functional Analysis · Mathematics 2022-07-06 M. Laura Arias , Alejandra Maestripieri

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

In this paper, we discuss models of the common knowledge logic. The common knowledge logic is a multi-modal logic that includes the modal operators $\mathsf{K}_{i}$ ($i\in\mathcal{I}$, where $\mathcal{I}$ is a finite set of agents) and…

Logic · Mathematics 2025-12-23 Yoshihito Tanaka

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…

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the…

Logic · Mathematics 2020-11-05 Stanislav Kikot , Ilya Shapirovsky , Evgeny Zolin

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

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