Weak completeness theorem for propositional linear time temporal logic

DOI10.2478/V10037-012-0027-8MaRDI QIDQ2852161zbMATH OpenOpenAlexFDO

Authors Mariusz Giero

Publication date 8 October 2013

Published in Formalized Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2478/v10037-012-0027-8

zbMATH Keywords

completeness theoremtemporal logictemporal modelsatisfiability theoremweak completeness theorem

Mathematics Subject Classification ID

Temporal logic (03B44)

Recommendations

• The properties of sets of temporal logic subformulas
• A hierarchical completeness proof for propositional temporal logic
• The complexity of propositional linear temporal logics
• The temporal logic of branching time
• Completeness theorem for a first order linear-time logic

Cites work

• Continuity of barycentric coordinates in Euclidean topological spaces
• Semantics of MML query -- ordering
• Temporal logic and state systems
• The axiomatization of propositional linear time temporal logic
• The derivations of temporal logic formulas
• The properties of sets of temporal logic subformulas

Cited in

(5)

• scientific article; zbMATH DE number 1424054 (Why is no real title available?)
• The properties of sets of temporal logic subformulas
• Partial cut elimination for propositional discrete linear time temporal logic
• The derivations of temporal logic formulas
• Weakest precondition semantics for time and concurrency

This page was built for publication: Weak completeness theorem for propositional linear time temporal logic

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