Dordrecht: D. Reidel (1972)

Authors
Sören Stenlund
Uppsala University
Abstract
The main aim of Schonfinkel's paper was methodological: to reduce the primitive logical notions to as few and definite notions as possible. ...
Keywords Proof theory  Combinatory logic
Categories (categorize this paper)
Call number QA9.S753
ISBN(s) 9027703051   9789027703057
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,704
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

No references found.

Add more references

Citations of this work BETA

A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.
An Interpretation of Classical Proofs.Glen Helman - 1983 - Journal of Philosophical Logic 12 (1):39 - 71.
Prelogic of Logoi.Marcel Crabbé - 1976 - Studia Logica 35 (3):219 - 226.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
7 ( #971,696 of 2,340,117 )

Recent downloads (6 months)
1 ( #515,720 of 2,340,117 )

How can I increase my downloads?

Downloads

My notes