Supplement to Temporal Logic
Supplement: Some Variations of the Axiomatic System for LTL
Note that (GFPG) generalizes the induction axiom (IND) φ∧G(φ→Xφ)→Gφ (which we discuss in Section 4.1). In fact, the axiom (GFPG) can be replaced by the following induction rule, which is deducible in the LTL system provided in the main text:
- If ⊢ψ→φ∧Xψ, then ⊢ψ→Gφ.
Likewise, (LFPU) can be replaced by the following derivable rule:
- If ⊢(ψ∨(φ∧Xθ))→θ, then ⊢φUψ→θ.
Moreover, if we define Gp as ¬(⊤U¬p), the axioms (FPG) and (GFPG) become deducible from the rest.