A hierarchical completeness proof for propositional temporal logic

DOI10.1007/B12001MaRDI QIDQ5305654zbMATH OpenOpenAlexFDO

Authors Ben Moszkowski

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12001

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• A hierarchical analysis of propositional temporal logic based on intervals
• scientific article; zbMATH DE number 1786650
• A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
• A complete axiom system for propositional interval temporal logic with infinite time
• Propositional temporal logics: decidability and completeness

Cited in

(10)

• A complete axiom system for propositional interval temporal logic with infinite time
• scientific article; zbMATH DE number 1424054 (Why is no real title available?)
• A Complete Proof System for First-order Interval Temporal Logic with Projection
• Weak completeness theorem for propositional linear time temporal logic
• A hierarchical analysis of propositional temporal logic based on intervals
• On the completeness and decidability of duration calculus with iteration
• Complete Proof System for QPTL
• A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
• scientific article; zbMATH DE number 2196589 (Why is no real title available?)
• scientific article; zbMATH DE number 5696770 (Why is no real title available?)

This page was built for publication: A hierarchical completeness proof for propositional temporal logic

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