English
Related papers

Related papers: Toward the van Benthem Characterization Theorem fo…

200 papers

The $N$-representability problem for non-collinear spin-polarized densities was left open in the pioneering work of von Barth and Hedin setting up the Kohn-Sham density functional theory for magnetic compounds. In this letter, we…

Mathematical Physics · Physics 2025-05-20 David Gontier

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

Recently, Baltag and van Benthem introduced a decidable logic of functional dependence (LFD) that extends the logic of Cylindrical Relativized Set Algebras (CRS) with atomic local dependence statements. Its semantics can be given in terms…

Logic in Computer Science · Computer Science 2021-09-20 Raoul Koudijs

We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite pi-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a…

Logic in Computer Science · Computer Science 2012-01-12 Yuxing Deng , Alwen Tiu

As an alternative to Kripke models, simplicial complexes are a versatile semantic primitive on which to interpret epistemic logic. Given a set of vertices, a simplicial complex is a downward closed set of subsets, called simplexes, of the…

Logic in Computer Science · Computer Science 2024-06-25 Marta Bílková , Hans van Ditmarsch , Roman Kuznets , Rojo Randrianomentsoa

We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse…

Logic in Computer Science · Computer Science 2025-06-18 Justus Becker

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

Combinatorics · Mathematics 2018-05-11 Dario De Stavola

I generalize acyclic deterministic structural causal models to the nondeterministic case and argue that this offers an improved semantics for counterfactuals. The standard, deterministic, semantics developed by Halpern (and based on the…

Artificial Intelligence · Computer Science 2025-03-12 Sander Beckers

Game comonads provide categorical semantics for comparison games in Finite Model Theory, thus providing an abstract characterisation of logical equivalence for a wide range of logics, each one captured through a specific choice of comonad.…

Logic in Computer Science · Computer Science 2024-08-15 Santiago Figueira , Gabriel Goren-Roig

We introduce a modal logic for describing statistical knowledge, which we call statistical epistemic logic. We propose a Kripke model dealing with probability distributions and stochastic assignments, and show a stochastic semantics for the…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

We propose an epistemic approach to formalizing statistical properties of machine learning. Specifically, we introduce a formal model for supervised learning based on a Kripke model where each possible world corresponds to a possible…

Logic in Computer Science · Computer Science 2023-07-19 Yusuke Kawamoto

I investigate the superintuitionistic analogue of the modal logic of chequered subsets of $\mathbb{R}^\infty$ introduced by van Benthem et al. It is observed that this logic possesses the disjunction property, contains the Scott axiom,…

Logic in Computer Science · Computer Science 2018-08-21 Tadeusz Litak

Proving representability of derived moduli stacks of solutions to non-linear elliptic partial differential equations generally requires significant analytic machinery. In this paper, we instead show that representability naturally follows…

Algebraic Geometry · Mathematics 2026-04-28 Rhiannon Savage

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of concept combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC TR, whose semantics is based on the…

Artificial Intelligence · Computer Science 2019-08-13 Antonio Lieto , Gian Luca Pozzato

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Logic in Computer Science · Computer Science 2019-09-04 Wesley H. Holliday , Tadeusz Litak

There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\store, \jump\}$ with or without nominals (Areces, Blackburn, Marx), $\jump$ with or…

Logic · Mathematics 2026-01-14 Guillermo Badia , Daniel Gaina , Alex Knapp , Tomasz Kowalski , Martin Wirsing

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and…

Artificial Intelligence · Computer Science 2023-03-24 Didier Dubois , Lluis Godo , Henri Prade

Inthispaperwedescribeaconcept-wisemulti-preferencesemantics for description logic which has its root in the preferential approach for modeling defeasible reasoning in knowledge representation. We argue that this proposal, beside satisfying…

Artificial Intelligence · Computer Science 2020-09-03 Laura Giordano , Valentina Gliozzi , Daniele Theseider Dupré

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

Let k be a base field of positive characteristic. Making use of topological periodic cyclic homology, we start by proving that the category of noncommutative numerical motives over k is abelian semi-simple, as conjectured by Kontsevich.…

Algebraic Geometry · Mathematics 2019-03-05 Goncalo Tabuada