Journal of Symbolic Logic

On Recursion Theory in $I\sum_1$

Petr Hajek and Antonin Kucera
Source: J. Symbolic Logic Volume 54, Issue 2 (1989), 576-589.

Abstract

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

Full-text: Remote access
If you are a member of the ASL, log in to Euclid for access.
Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.jsl/1183742928
JSTOR: links.jstor.org
Mathematical Reviews number (MathSciNet): MR997890
Zentralblatt MATH identifier: 0703.03019


2013 © Association for Symbolic Logic

Journal of Symbolic Logic

Journal of Symbolic Logic

Turn MathJax Off
What is MathJax?