- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Combinators, 2-terms and proof theory
Dordrecht,: D. Reidel (1972)
Abstract
The main aim of Schonfinkel's paper was methodological: to reduce the primitive logical notions to as few and definite notions as possible. ...Author's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Intuitionism and proof theory.A. Kino, John Myhill & Richard Eugene Vesley (eds.) - 1970 - Amsterdam,: North-Holland Pub. Co..
Combinatory logic with discriminators.John T. Kearns - 1969 - Journal of Symbolic Logic 34 (4):561-575.
A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
Inference Rules and the Meaning of the Logical Constants.Hermógenes Oliveira - 2019 - Dissertation, Eberhard Karls Universität Tübingen
Compact bracket abstraction in combinatory logic.Sabine Broda & Luis Damas - 1997 - Journal of Symbolic Logic 62 (3):729-740.
The church-Rosser property in dual combinatory logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.
Expedited Broda-Damas Bracket Abstraction.M. W. Bunder - 2000 - Journal of Symbolic Logic 65 (4):1850-1857.
The Non-categoricity of Logic (I). The Problem of a Full Formalization.Constantin C. Brîncuș - 1956 - In Henri Wald & Academia Republicii Populare Romîne (eds.), Probleme de Logica. Editura Academiei Republicii Populare Romîne. pp. 137-157.
Analytics
Added to PP
2009-01-28
Downloads
18 (#1,119,623)
6 months
2 (#1,690,857)
2009-01-28
Downloads
18 (#1,119,623)
6 months
2 (#1,690,857)
Historical graph of downloads
Author's Profile
Citations of this work
An interpretation of classical proofs.Glen Helman - 1983 - Journal of Philosophical Logic 12 (1):39 - 71.
A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-9l5tj dc2