Variations on a thesis: intuitionism and computability

Notre Dame Journal of Formal Logic 28 (4):536-580 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

External links

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

Through your library

Similar books and articles

Concrete computability.Thomas H. Payne - 1975 - Notre Dame Journal of Formal Logic 16 (2):238-244.
General computability.Thomas H. Payne - 1980 - Notre Dame Journal of Formal Logic 21 (2):277-292.
Intuitionism reconsidered.Hugues Leblanc - 1962 - Notre Dame Journal of Formal Logic 3 (2):79-82.
Computability on finite linear configurations.Thomas H. Payne - 1975 - Notre Dame Journal of Formal Logic 16 (3):354-356.
A simple generalization of Turing computability.William J. Thomas - 1979 - Notre Dame Journal of Formal Logic 20 (1):95-102.
Variations on a theme of Bernays.John Myhill - 1963 - Notre Dame Journal of Formal Logic 4 (4):274-282.

Analytics

Added to PP
2010-08-24

Downloads
33 (#697,859)

6 months
14 (#248,807)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A general logic.John Slaney - 1990 - Australasian Journal of Philosophy 68 (1):74 – 88.
Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references