Proof theory and complexity

Synthese 62 (2):173-189 (1985)
Abstract This article has no associated abstract. (fix it)
Keywords proof theory  complexity  efficiency of proofs
Categories (categorize this paper)
DOI 10.1007/BF00486045
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,658
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
J. Y. Girard (1991). Proof Theory and Logical Complexity. Annals of Pure and Applied Logic 53 (4):197.

View all 8 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

48 ( #71,159 of 1,726,249 )

Recent downloads (6 months)

5 ( #147,227 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.