English
Related papers

Related papers: A Coalgebraic Semantics for Intuitionistic Modal L…

200 papers

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

We introduce a new semantics for a logic of explicit and implicit beliefs based on the concept of multi-agent belief base. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and…

Artificial Intelligence · Computer Science 2018-12-19 Emiliano Lorini

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Logic · Mathematics 2012-10-30 Lev Beklemishev , David Gabelaia

We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…

We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality, which has a limited version of the contraction and permutation rules. The categorical part of the semantics is a monoidal biclosed…

Logic in Computer Science · Computer Science 2021-01-27 Lachlan McPheat , Mehrnoosh Sadrzadeh , Hadi Wazni , Gijs Wijnholds

We introduce a relativized version of random Kripke's schema and show how it may be applied in the investigation of the expressive power of intuitionistic real algebra by interpreting second-order Heyting arithmetic in it.

Logic · Mathematics 2024-01-09 Miklós Erdélyi-Szabó

The immensely fruitful concept of Grothendieck topology or covering issued from the efforts of algebraic geometers to study "sheaf-like" objects defined on categories more general than the lattice of open sets on a topological space. In the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 John L. Bell

While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the…

Logic in Computer Science · Computer Science 2014-06-09 Daniel Gorín , Lutz Schröder

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos $\mathcal{E}$. In contrast to the well-known interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the…

Logic · Mathematics 2017-03-07 Steve Awodey , Kohei Kishida , Hans-Christoph Kotzsch

We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic…

Logic in Computer Science · Computer Science 2020-01-01 Philippe Balbiani , Joseph Boudou , Martín Diéguez , David Fernández-Duque

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

We show that the category OS of operator spaces, with complete contractions as morphisms, is locally countably presentable. This result, together with its symmetric monoidal closed structure with respect to the projective tensor product of…

Category Theory · Mathematics 2024-12-31 Bert Lindenhovius , Vladimir Zamdzhiev

In recent years, the compositional distributional approach in computational linguistics has opened the way for an integration of the \emph{lexical} aspects of meaning into Lambek's type-logical grammar program. This approach is based on the…

Logic in Computer Science · Computer Science 2021-05-13 Giuseppe Greco , Fei Liang , Michael Moortgat , Alessandra Palmigiano , Apostolos Tzimoulis

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of…

Logic · Mathematics 2020-11-11 Ivano Ciardelli , Rosalie Iemhoff , Fan Yang

We generalize intuitionistic tense logics to the multi-modal case by placing grammar logics on an intuitionistic footing. We provide axiomatizations for a class of base intuitionistic grammar logics as well as provide axiomatizations for…

Logic · Mathematics 2021-10-05 Tim S. Lyon

We combine several mini miracles to achieve an elementary understanding of infinite loop spaces and very effective spectra in the algebro-geometric setting of motivic homotopy theory. Our approach combines $\Gamma$-spaces and framed…

Algebraic Geometry · Mathematics 2022-04-22 Grigory Garkusha , Ivan Panin , Paul Arne Østvær

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

We survey systematic approaches to basis-restricted fragments of propositional logic and modal logics, with an emphasis on how expressive power and computational complexity depend on the allowed operators. The propositional case is…

Logic in Computer Science · Computer Science 2026-03-06 Nick Bezhanishvili , Balder ten Cate , Arunavo Ganguly , Arne Meier
‹ Prev 1 8 9 10 Next ›