- 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 weak absolute consistency proof for some systems of illative combinatory logic
Journal of Symbolic Logic 48 (3):771-776 (1983)
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
$\Lambda$-elimination in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Journal of Symbolic Logic 63 (3):869-890.
Consistency notions in illative combinatory logic.M. W. Bunder - 1977 - Journal of Symbolic Logic 42 (4):527-529.
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.
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.
Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic.M. W. Bunder - 1987 - Journal of Symbolic Logic 52 (1):89-110.
A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
Scott's models and illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):609-612.
Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
Analytics
Added to PP
2009-01-28
Downloads
49 (#324,649)
6 months
10 (#268,644)
2009-01-28
Downloads
49 (#324,649)
6 months
10 (#268,644)
Historical graph of downloads
Citations of this work
On church's formal theory of functions and functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
On church's formal theory of functions and functionals: The λ-calculus: connections to higher type recursion theory, proof theory, category theory.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
References found in this work
Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
Illative combinatory logic without equality as a primitive predicate.M. W. Bunder - 1982 - Notre Dame Journal of Formal Logic 23 (1):62-70.
Progress report on generalized functionality.Jonathan P. Seldin - 1979 - Annals of Mathematical Logic 17 (1):29.
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-64dd777598-g9b9l uwo