Algebraic aspects of cut elimination

Studia Logica 77 (2):209 - 240 (2004)
Abstract
We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the completeness of the sequent system without cut with respect to the class of algebras for the sequent system with cut, by using the quasi-completion of these Gentzen structures. It is shown that the quasi-completion is a generalization of the MacNeille completion. Moreover, the finite model property is obtained for many cases, by modifying our completeness proof. This is an algebraic presentation of the proof of the finite model property discussed by Lafont [12] and Okada-Terui [17].
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/B:STUD.0000037127.15182.2a
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,861
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

View all 12 citations / Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
24 ( #230,462 of 2,210,588 )

Recent downloads (6 months)
7 ( #64,886 of 2,210,588 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature