scientific article; zbMATH DE number 7163279
From MaRDI portal
Publication:5214813
zbMath1442.03010arXiv1903.09463MaRDI QIDQ5214813
No author found.
Publication date: 5 February 2020
Full work available at URL: https://arxiv.org/abs/1903.09463
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Probability and inductive logic (03B48) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20)
Related Items (8)
MODAL OPERATORS ON RINGS OF CONTINUOUS FUNCTIONS ⋮ Unnamed Item ⋮ On counting propositional logic and Wagner's hierarchy ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Free modal Riesz spaces are Archimedean: a syntactic proof ⋮ Unnamed Item ⋮ An approach to stochastic processes via non-classical logic ⋮ On measure quantifiers in first-order arithmetic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Abstract ordered compact convex sets and algebras of the (sub)probabilistic powerdomain monad over ordered compact spaces
- Advanced Łukasiewicz calculus and MV-algebras
- Probabilistic systems coalgebraically: a survey
- Stone coalgebras
- Results on the propositional \(\mu\)-calculus
- Every state on semisimple MV-algebra is integral
- Łukasiewicz logic and Riesz spaces.
- MV-algebras with internal states and probabilistic fuzzy logics
- On the proof theory of the modal mu-calculus
- A probabilistic PDL
- Topology and duality in modal logic
- Semantics of probabilistic programs
- Bisimulation through probabilistic testing
- Topology and descriptive set theory
- A logic for reasoning about time and reliability
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- A structural approach to operational semantics
- Towards a structural proof theory of probabilistic \(\mu\)-calculi
- On the variety of Riesz spaces
- On closed elements in closure algebras
- An axiomatization of full Computation Tree Logic
- Introduction to Coalgebra
- From Kleisli Categories to Commutative C *-Algebras: Probabilistic Gelfand Duality
- Strong Completeness for Markovian Logics
- On the equivalence of game and denotational semantics for the probabilistic mu-calculus
- Reasoning with time and chance
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Łukasiewicz μ-calculus
- Probabilistic modal {\mu}-calculus with independent product
- Riesz Modal Logic with Threshold Operators
- Stone Duality for Markov Processes
- Results on the quantitative μ-calculus qM μ
- A Proof System for the Linear Time μ-Calculus
- Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- CONCUR 2003 - Concurrency Theory
This page was built for publication:
