English
Related papers

Related papers: Probabilistic logics based on Riesz spaces

200 papers

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

Classical Analysis and ODEs · Mathematics 2017-11-13 Itay Londner

This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…

Logic in Computer Science · Computer Science 2025-02-11 Rob van Glabbeek , Jan Friso Groote , Erik de Vink

Machines that can replicate human intelligence with type 2 reasoning capabilities should be able to reason at multiple levels of spatio-temporal abstractions and scales using internal world models. Devising formalisms to develop such…

Artificial Intelligence · Computer Science 2025-07-01 Vaisakh Shaj

Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…

Statistics Theory · Mathematics 2014-08-12 Cael L. Hasse

Riesz representation theorem, Daniell-Stone theorem for Daniell integrals and Stone's representation theorem for probability and measure algebras are three important classical results in analysis concerning existence of measures with…

Classical Analysis and ODEs · Mathematics 2019-08-13 Alireza Mofidi

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 classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general…

Logic in Computer Science · Computer Science 2023-06-22 Clemens Kupke , Jurriaan Rot

We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of $x-y$ dualities in a broader context of log…

Mathematical Physics · Physics 2024-12-05 Alexander Alexandrov , Boris Bychkov , Petr Dunin-Barkowski , Maxim Kazarian , Sergey Shadrin

The structure of subspaces of a Hilbert space that are invariant under unitary representations of a discrete group is related to a notion of Hilbert modules endowed with inner products taking values in spaces of unbounded operators. A…

Functional Analysis · Mathematics 2015-07-01 Davide Barbieri , Eugenio Hernández , Victoria Paternostro

This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

The article offers a fresh perspective on Grzegorczyk logic Grz, introducing a simplified axiomatization and extending the analysis to its natural modal extensions, Grz.2 and Grz.3. I develop a control statement theory for these logics,…

Logic · Mathematics 2026-02-17 Wojciech Aleksander Wołoszyn

This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…

Logic in Computer Science · Computer Science 2024-08-14 Luca Aceto , Antonis Achilleos , Elli Anastasiadi , Adrian Francalanza , Anna Ingólfsdóttir

In this paper we develop a new set of results based on a nonlocal gradient jointly inspired by the Riesz s-fractional gradient and Peridynamics, in the sense that its integration domain depends on a ball of radius delta > 0 (horizon of…

Analysis of PDEs · Mathematics 2022-11-07 José Carlos Bellido , Javier Cueto , Carlos Mora-Corral

The purpose of this paper is threefold. First the natural extension of Riesz potentials to the context of quasi metric measure spaces for the class of upper doubling measures are studied on Lebesgue spaces, obtaining necessary and…

Classical Analysis and ODEs · Mathematics 2013-09-17 Bibiana Iaffei , Liliana Nitti

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…

Logic · Mathematics 2024-05-14 Wesley H. Holliday

We present the axiomatisation of the fuzzy bi-G\"{o}del modal logic (formulated in the language containing $\triangle$ and treating the coimplication as a defined connective) and establish its PSpace-completeness. We also consider its…

Logic · Mathematics 2024-03-08 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

Logic · Mathematics 2024-06-21 Sam van Gool , Jérémie Marquès

Although randomization has long been used in distributed computing, formal methods for reasoning about probabilistic concurrent programs have lagged behind. No existing program logics can express specifications about the full distributions…

Logic in Computer Science · Computer Science 2025-11-26 Noam Zilberstein , Alexandra Silva , Joseph Tassarotti