English
Related papers

Related papers: Implicit Kripke Semantics and Ultraproducts in Str…

200 papers

We introduce structured active inference, a large generalization and formalization of active inference using the tools of categorical systems theory. We cast generative models formally as systems "on an interface", with the latter being a…

Artificial Intelligence · Computer Science 2024-06-13 Toby St Clere Smithe

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic · Mathematics 2020-08-04 Sergey Slavnov

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The…

Artificial Intelligence · Computer Science 2018-02-06 Mikkel Birkegaard Andersen , Thomas Bolander , Hans van Ditmarsch , Martin Holm Jensen

In this paper, we introduce a translation that combines the $j$-translation with Kripke forcing in the internal logic of an elementary topos. First, we show that our translation is sound for intuitionistic first-order logic and Heyting…

Logic · Mathematics 2026-03-23 Satoshi Nakata

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

$\frac{3}{2}$-institutions have been introduced as an extension of institution theory that accommodates implicitly partiality of the signature morphisms together with its syntactic and semantic effects. In this paper we show that ordinary…

Logic · Mathematics 2017-11-15 Răzvan Diaconescu

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

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

Logic · Mathematics 2017-05-02 Sergey A. Melikhov

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

Logic in Computer Science · Computer Science 2024-05-22 Michael Benedikt , Ehud Hrushovski

Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in concurrency theory. Both models are commonly believed to be equi-expressive. One can find many ad-hoc embeddings of one of these models…

Logic in Computer Science · Computer Science 2015-05-20 M. A. Reniers , T. A. C. Willemse

Understanding and manipulating concrete and abstract concepts is fundamental to human intelligence. Yet, they remain challenging for artificial agents. This paper introduces a multimodal generative approach to high order abstract concept…

Computation and Language · Computer Science 2024-10-04 Haodong Xie , Rahul Singh Maharjan , Federico Tavella , Angelo Cangelosi

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

Logic · Mathematics 2017-05-26 Grigory K. Olkhovikov

We provide a mathematically rigorous definition of local approximation and demonstrate its applicability to some interesting classes of structures. In particular, we prove that any compact simple Lie group is locally approximated by finite…

Logic · Mathematics 2026-04-02 Boris Zilber

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument. Some argument premises are modified, others are dropped, modal…

Logic in Computer Science · Computer Science 2020-06-16 Christoph Benzmüller

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation…

Logic in Computer Science · Computer Science 2011-03-07 Zoran Majkic

This paper is a survey of our work based on the stratified Morse theory of Goresky and MacPherson. First we discuss the Morse theory of Euclidean space stratified by an arrangement. This is used to show that the complement of a complex…

Algebraic Geometry · Mathematics 2007-05-23 Daniel C. Cohen , Peter Orlik

Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and…

Logic in Computer Science · Computer Science 2026-03-31 Kexu Wang , Liangda Fang

We propose a many-sorted modal logic for reasoning about knowledge in multi-agent systems. Our logic introduces a clear distinction between participating agents and the environment. This allows to express local properties of agents and…

Logic in Computer Science · Computer Science 2023-08-02 Eric Goubault , Roman Kniazev , Jérémy Ledent