
Syntactic cutelimination and backward proofsearch for tense logic via linear nested sequents (Extended version)
We give a linear nested sequent calculus for the basic normal tense logi...
read it

Probabilistic logics based on Riesz spaces
We introduce a novel realvalued endogenous logic for expressing propert...
read it

No speedup for geometric theories
Geometric theories based on classical logic are conservative over their ...
read it

A Trustful Monad for Axiomatic Reasoning with Probability and Nondeterminism
The algebraic properties of the combination of probabilistic choice and ...
read it

The Topological MuCalculus: completeness and decidability
We study the topological μcalculus, based on both Cantor derivative and...
read it

On Quantified Modal Theorem Proving for Modeling Ethics
In the last decade, formal logics have been used to model a wide range o...
read it

Probabilistic Programming Semantics for Name Generation
We make a formal analogy between random sampling and fresh name generati...
read it
Proof Theory of Riesz Spaces and Modal Riesz Spaces
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 mucalculus.
READ FULL TEXT
Comments
There are no comments yet.