##
###
Proof Theory and Algebra in Substructural Logics
[chapter]

Kazushige Terui

2011
*
Lecture Notes in Computer Science
*

It is quite well understood that propositional logics are tightly connected to ordered algebras via algebraic completeness, and because of this connection proof theory is often useful in the algebraic context too. A prominent example is that one deductively proves the interpolation theorem for a given logic in order to derive the algebraic amalgamation property for the corresponding variety as a corollary. Other examples include uniform interpolation, disjunction property, local deduction
## more »

... m, and termination of complete proof search with their corresponding algebraic properties. Proof theory is, however, not merely an external device for deriving algebraic consequences as corollaries. The connection is even tighter, and it also works inside algebra as a source of various algebraic constructions. For instance, Maehara's sequent-based method for proving the interpolation theorem gives rise to a direct construction of an algebra required for the amalgamation property. Finding a new variant of sequent calculus (such as hypersequent calculus) amounts to finding a new variant of MacNeille completions (generalizations of Dedekind's completion Q → R). Proving cut elimination for such a generalized sequent calculus is closely related to proving that a variety is closed under the corresponding generalized completions. Finally, transforming Hilbert axioms into Gentzen rules is not only important for proving cut elimination and related conservativity results, but also crucial for ensuring that the above proof theoretic constructions do work in algebra properly. In this talk, we will discuss such internal contributions of proof theory in algebra. Our basic framework is substructural logics, which comprise linear, relevance, fuzzy and superintuitionistic logics. Algebraically, they correspond to varieties of residuated lattices, that include Heyting algebras and many others. We will exemplify several proof theoretic methods that directly work for residuated lattices, then develop a general theory for such internal constructions in terms of residuated frames, and see their possibilities and limitations in terms of the substructural hierarchy -a hierarchy that classifies nonclassical axioms according to how difficult they are to deal with in proof theory. K. Brünnler and G. Metcalfe (Eds.): TABLEAUX

doi:10.1007/978-3-642-22119-4_3
fatcat:vcf3dmefgzc4zhm2gnwvqiitfe