Weak Completeness Theorem for Propositional Linear Time Temporal Logic
We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2012-12-01
|
| Series: | Formalized Mathematics |
| Online Access: | https://doi.org/10.2478/v10037-012-0027-8 |