Strong completeness for Markovian logics

DOI10.1007/978-3-642-40313-2_58MaRDI QIDQ2849951zbMATH OpenOpenAlexFDO

Authors Dexter Kozen, Radu Mardare, Prakash Panangaden

Publication date 20 September 2013

Published in Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/33380

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Modal logic (including the logic of norms) (03B45)

Recommendations

• Continuous Markovian logics -- axiomatization and quantified metatheory
• Continuous Markovian logic -- from complete axiomatization to the metric space of formulas
• Modular Markovian Logic
• Completeness theorems for \(\sigma \)-additive probabilistic semantics
• Riesz modal logic for Markov processes

Cited in

(9)

• Alternation-free weighted mu-calculus: decidability and completeness
• scientific article; zbMATH DE number 6987096 (Why is no real title available?)
• Probabilistic NetKAT
• scientific article; zbMATH DE number 795175 (Why is no real title available?)
• Concurrent weighted logic
• Probabilistic logics based on Riesz spaces
• Continuous Markovian logics -- axiomatization and quantified metatheory
• A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
• Continuous Markovian logic -- from complete axiomatization to the metric space of formulas

This page was built for publication: Strong completeness for Markovian logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849951)