SIGN IN
SIGN UP
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
Full Text:
PDF
Buy this Article
Author:
Stephen A. Cook
Published in:
· Proceeding
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Pages 83-97
ACM
New York, NY
, USA
©1975
table of contents
doi>
10.1145/800116.803756
1975 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 26
· Downloads (cumulative): 386
· Citation Count: 26
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
lambda calculus and related systems
proof theory
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder