For Oiva Ketonen's 85th birthday

Bulletin of Symbolic Logic 4 (4):418-435 (1998)
  Copy   BIBTEX

Abstract

A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated. Applications include a system of predicate logic with equality in which also cuts on the equality axioms are eliminated.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-10-31

Downloads
47 (#348,224)

6 months
11 (#271,859)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Jan Von Plato
University of Helsinki

References found in this work

Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
Mathematical Intuitionism. Introduction to Proof Theory.A. G. Dragalin & E. Mendelson - 1990 - Journal of Symbolic Logic 55 (3):1308-1309.
Proof Theory and Logical Complexity. [REVIEW]Helmut Pfeifer - 1991 - Annals of Pure and Applied Logic 53 (4):197.

Add more references