On recursion theory in I∑

Journal of Symbolic Logic 54 (2):576 - 589 (1989)
  Copy   BIBTEX

Abstract

It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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
83 (#271,697)

6 months
7 (#614,157)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

The logic of π1-conservativity.Petr Hajek & Franco Montagna - 1990 - Archive for Mathematical Logic 30 (2):113-123.
On some formalized conservation results in arithmetic.P. Clote, P. Hájek & J. Paris - 1990 - Archive for Mathematical Logic 30 (4):201-218.

Add more citations

References found in this work

No references found.

Add more references