Complete Proof System for QPTL

DOI10.1093/LOGCOM/12.5.701MaRDI QIDQ4779585zbMATH OpenOpenAlexFDO

Authors Yonit Kesten, Amir Pnueli

Publication date 21 June 2003

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/966b905778116a4844bb87d02a2eaea5d3f38d6e

zbMATH Keywords

completenessrefinementtemporal logicaxiomatic systemflexible variablesBüchi automatahistory schemeprophecy schemerigid variable

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• scientific article; zbMATH DE number 2196589
• Propositional temporal logics: decidability and completeness
• A hierarchical completeness proof for propositional temporal logic
• scientific article; zbMATH DE number 1786650
• A complete proof system for propositional projection temporal logic

Cited in

(12)

• Propositional Dynamic Logic for Hyperproperties
• The refinement calculus of reactive systems
• A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
• Propositional dynamic logic with program quantifiers
• Tool support for learning Büchi automata and linear temporal logic
• Functional specification of hardware via temporal logic
• Model-checking iterated games
• scientific article; zbMATH DE number 2196589 (Why is no real title available?)
• A proof system for unified temporal logic
• A novel approach to verifying context free properties of programs
• A decision procedure and complete axiomatization for projection temporal logic
• A sound and complete proof system for a unified temporal logic

This page was built for publication: Complete Proof System for QPTL

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