- 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
Illative combinatory logic without equality as a primitive predicate
Notre Dame Journal of Formal Logic 23 (1):62-70 (1982)
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
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.
Significance and illative combinatory logics.M. W. Bunder - 1980 - Notre Dame Journal of Formal Logic 21 (2):380-384.
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.
Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
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.
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic.M. W. Bunder & W. J. M. Dekkers - 2005 - Notre Dame Journal of Formal Logic 46 (2):181-205.
Analytics
Added to PP
2010-08-24
Downloads
52 (#298,620)
6 months
10 (#382,620)
2010-08-24
Downloads
52 (#298,620)
6 months
10 (#382,620)
Historical graph of downloads
Citations of this work
A weak absolute consistency proof for some systems of illative combinatory logic.M. W. Bunder - 1983 - Journal of Symbolic Logic 48 (3):771-776.
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-xdvnm uwo