Algebraic proof theory for substructural logics: Cut-elimination and completions

Abstract

We carry out a unified investigation of two prominent topics in proof theory and order algebra: cut-elimination and completion, in the setting of substructural logics and residuated lattices. We introduce the substructural hierarchy — a new classification of logical axioms (algebraic equations) over full Lambek calculus FL, and show that a stronger form of cutelimination for extensions of FL and the MacNeille completion for subvarieties of pointed residuated lattices coincide up to the level N2 in the hierarchy. Negative results, which indicate limitations of cut-elimination and the MacNeille completion, as well as of the expressive power of structural sequent calculus rules, are also provided. Our arguments interweave proof theory and algebra, leading to an integrated discipline which we call algebraic proof theory. © 2011 Elsevier B.V. All rights reserved.

DOI: 10.1016/j.apal.2011.09.003

Extracted Key Phrases

3 Figures and Tables

01020201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Ciabattoni2012AlgebraicPT, title={Algebraic proof theory for substructural logics: Cut-elimination and completions}, author={Agata Ciabattoni and Nikolaos Galatos and Kazushige Terui}, journal={Ann. Pure Appl. Logic}, year={2012}, volume={163}, pages={266-290} }