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)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,694

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
36 (#320,350)

6 months
1 (#388,319)

Historical graph of downloads
How can I increase my downloads?

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.

Add more references

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.

Add more citations

Similar books and articles