- 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
A property which guarantees termination in weak combinatory logic and subtree replacement systems
Notre Dame Journal of Formal Logic 22 (4):344-356 (1981)
Abstract
This article has no associated abstract. (fix it)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
On the equivalence of systems of rules and systems of axioms in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):603-608.
Various systems of set theory based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (2):192-206.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.
The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.
A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
$\Lambda$-elimination in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.
Scott's models and illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):609-612.
Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
Analytics
Added to PP
2010-08-24
Downloads
1 (#1,919,133)
6 months
1 (#1,722,083)
2010-08-24
Downloads
1 (#1,919,133)
6 months
1 (#1,722,083)
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
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-6686886f5-2nz2h uwo