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)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273470
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,840
Through your library
References found in this work BETA
Propositional and Predicate Calculuses Based on Combinatory Logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
Progress Report on Generalized Functionality.Jonathan P. Seldin - 1979 - Annals of Mathematical Logic 17 (1-2):29-59.
Illative Combinatory Logic Without Equality as a Primitive Predicate.M. W. Bunder - 1982 - Notre Dame Journal of Formal Logic 23 (1):62-70.

Add more references

Citations of this work BETA
On Church's Formal Theory of Functions and Functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

14 ( #337,026 of 2,178,268 )

Recent downloads (6 months)

1 ( #316,623 of 2,178,268 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums