Library Deduxit.Linear.FirstOrderProofs
First-order proof terms
From Deduxit.Linear Require Export FirstOrderFormulas.
Section Proofs.
Context {symbol : Type}.
Local Notation formula := (formula symbol).
Local Notation term := (term symbol).
Which disjunct a ⊕ rule keeps.
A proof term. Below, ⊢ Θ ; Γ is a dyadic sequent: Θ is the
unrestricted zone, whose formulas may be used any number of times,
and Γ the linear zone. The checker keeps the least Θ a subproof
needs.
⊢ Θ ; Γ, Δ, A ⊗ B from ⊢ Θ ; Γ, A and ⊢ Θ ; Δ, B
⊢ Θ ; Γ, A ⅋ B from ⊢ Θ ; Γ, A, B
| One
⊢ Θ ; 1
⊢ Θ ; Γ, ⊥ from ⊢ Θ ; Γ
⊢ Θ ; Γ, A & B from ⊢ Θ ; Γ, A and ⊢ Θ ; Γ, B
⊢ Θ ; Γ, A ⊕ B from ⊢ Θ ; Γ, A or from ⊢ Θ ; Γ, B
| Top
⊢ Θ ; Γ, ⊤ for any Γ
promotion, ⊢ Θ ; !A from ⊢ Θ ; A
⊢ Θ ; Γ, ?A from ⊢ Θ, A ; Γ: A moves into the unrestricted
zone
⊢ Θ, A ; Γ from ⊢ Θ, A ; Γ, A: a use of A that leaves it
in the unrestricted zone
⊢ Θ ; Γ, Δ from ⊢ Θ ; Γ, A and ⊢ Θ ; Δ, A⊥, with cut
⊢ Θ ; Γ, ∀x. A from ⊢ Θ ; Γ, A[a/x], where the eigenvariable
a occurs in no formula of the conclusion
⊢ Θ ; Γ, ∃x. A from ⊢ Θ ; Γ, A[t/x], for a closed term t