Supplement to Temporal Logic
Supplement: Reynolds’ Axiomatic System for OBTL
Reynolds (2003) proposed complete axiomatic systems for OBTL, both for bundled tree validity and Ockhamist validity, assuming instant-based atomic propositions.
His system for bundled tree validity extends the minimal temporal logic Kt (see Section 3.5) by the axiom schemata (TRANS), (LIN-F), and (LIN-P) (see Section 3.6) as well as
- the S5 axiom schemata for ◻ (i.e. ◻(φ→ψ)→(◻φ→◻ψ),◻φ→φ,◊φ→◻◊φ),
- the axiom scheme G⊥→◻G⊥ for maximality of histories,
- the interaction axiom scheme Pφ→◻P◊φ, and
- the axiom scheme p→◻p for instant-based atomic propositions.
The inference rules comprise, in addition to (MP), (NECH), and (NECG) (see Section 3.5),
- the necessitation rule for ◻, and
- the so-called Gabbay Irreflexivity Rule: If ⊢(p∧H¬p)→φ, then ⊢φ, provided p does not occur in φ.
To completely axiomatize Ockhamist validity, Reynolds proposed to add the following infinite axiom scheme, which is supposed to guarantee the “limit closure property”:
- ◻G≤⋀n−1i=0(◊φi→◊F◊φi+1)→◊G≤⋀n−1i=0(◊φi→F◊φi+1)
where φ0,…,φn−1 are any OBTL formulae, φn=φ0, and G≤θ:=θ∧Gθ.