Weak completeness theorem for propositional linear time temporal logic

DOI10.2478/V10037-012-0027-8zbMATH Open1285.03011OpenAlexW1963842936MaRDI QIDQ2852161FDOQ2852161

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

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

zbMATH Keywords

completeness theoremtemporal logictemporal modelsatisfiability theoremweak completeness theorem

Mathematics Subject Classification ID

Temporal logic (03B44)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• 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)