DeepAI
Log In Sign Up

Proof Theory of Riesz Spaces and Modal Riesz Spaces

04/23/2020
by   Christophe Lucas, et al.
0

We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination. These are then used to obtain completely syntactic proofs of some interesting results concerning the two theories. Most notably, we prove a novel result: the theory of modal Riesz spaces is decidable. This work has applications in the field of logics of probabilistic programs since modal Riesz spaces provide the algebraic semantics of the Riesz modal logic underlying the probabilistic mu-calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/02/2019

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)

We give a linear nested sequent calculus for the basic normal tense logi...
03/22/2019

Probabilistic logics based on Riesz spaces

We introduce a novel real-valued endogenous logic for expressing propert...
05/10/2021

No speedup for geometric theories

Geometric theories based on classical logic are conservative over their ...
03/22/2020

A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism

The algebraic properties of the combination of probabilistic choice and ...
05/09/2019

Strong completeness of modal logics over 0-dimensional metric spaces

We prove strong completeness results for some modal logics with the univ...
05/18/2021

The Topological Mu-Calculus: completeness and decidability

We study the topological μ-calculus, based on both Cantor derivative and...
10/21/2021

Fuzzy Algebraic Theories

In this work we propose a formal system for fuzzy algebraic reasoning. T...