Lectures onType Theory
The unit-free ordered Lambek calculus
appendix sectionrules

The unit-free ordered Lambek calculus

The formulas, context words, and sequents of chapter 38 are A,B::=pABA\BB/A,Γ::=ϵA,Γ,ΓA. Greek capital metavariables denote possibly empty ordered contexts. The language has no formula for the empty-context unit. Context equality never exchanges adjacent formulas. The complete cut-free rule set is

AA
Id
ΓAΔB
Γ,ΔAB
Prod-R
Δ,A,B,ΘC
Δ,AB,ΘC
Prod-L
A,ΓB
ΓA\B
Bslash-R
ΓAΔ,B,ΘC
Δ,Γ,A\B,ΘC
Bslash-L
Γ,AB
ΓB/A
Slash-R
ΓAΔ,B,ΘC
Δ,B/A,Γ,ΘC
Slash-L

Cut is not a primitive rule. Its admissible ordered form is ΓAΔ,A,ΘCΔ,Γ,ΘCCut. Backward proof search tries Id, then the applicable succedent rule, then scans antecedent occurrences from left to right. At a product it tries Prod-L. At A\B it enumerates the prefix as Δ,Γ by increasing |Δ|; at B/A it enumerates the suffix as Γ,Θ by increasing |Γ|. The traversal is depth first.

The only structural extension used in the chapter adds Δ,A,B,ΘCΔ,B,A,ΘCEx. No braid or symmetry equation is part of either displayed calculus.

Search the book

Type to search the local edition.