DeepAI AI Chat
Log In Sign Up

A sequent calculus for a semi-associative law

by   Noam Zeilberger, et al.
University of Birmingham

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a semi-associative law (equivalently, right rotation). We establish a focusing property for this sequent calculus (a strengthening of cut-elimination), which yields the following coherence theorem: every valid entailment in the Tamari order has exactly one focused derivation. We then describe two main applications of the coherence theorem, including: 1. A new proof of the lattice property for the Tamari order, and 2. A new proof of the Tutte-Chapoton formula for the number of intervals in the Tamari lattice Y_n.


page 1

page 2

page 3

page 4


Combining First-Order Classical and Intuitionistic Logic

This paper studies a first-order expansion of a combination C+J of intui...

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation

In [6], Iemhoff introduced the notion of a focused axiom and a focused r...

Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

The Lambek calculus can be considered as a version of non-commutative in...

The Sequent Calculus of Skew Monoidal Categories

Szlachányi's skew monoidal categories are a well-motivated variation of ...

Proof Theory of Partially Normal Skew Monoidal Categories

The skew monoidal categories of Szlachányi are a weakening of monoidal c...

Fast Cut-Elimination using Proof Terms: An Empirical Study

Urban and Bierman introduced a calculus of proof terms for the sequent c...

Proof Search on Bilateralist Judgments over Non-deterministic Semantics

The bilateralist approach to logical consequence maintains that judgment...