Computer Science Logic
From MaRDI portal
Publication:5311264
DOI10.1007/b100120zbMath1095.68055OpenAlexW2481899496MaRDI QIDQ5311264
Publication date: 22 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100120
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (11)
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Temporal BI: proof system, semantics and translations ⋮ Exploring the Jungle of Intuitionistic Temporal Logics ⋮ Internal axioms for domain semirings ⋮ Modal Semirings Revisited ⋮ LTL is closed under topological closure ⋮ Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations ⋮ Combining linear-time temporal logic with constructiveness and paraconsistency ⋮ Automated Compositional Reasoning of Intuitionistically Closed Regular Properties ⋮ Constructive linear-time temporal logic: proof systems and Kripke semantics ⋮ Bounded linear-time temporal logic: a proof-theoretic investigation
This page was built for publication: Computer Science Logic
