If you need an accessible version of this item please contact JSTOR User Support

On Recursion Theory in I∑1

Petr Hájek and Antonín Kučera
The Journal of Symbolic Logic
Vol. 54, No. 2 (Jun., 1989), pp. 576-589
DOI: 10.2307/2274871
Stable URL: http://www.jstor.org/stable/2274871
Page Count: 14
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
On Recursion Theory in I∑1
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
576
    576
  • Thumbnail: Page 
577
    577
  • Thumbnail: Page 
578
    578
  • Thumbnail: Page 
579
    579
  • Thumbnail: Page 
580
    580
  • Thumbnail: Page 
581
    581
  • Thumbnail: Page 
582
    582
  • Thumbnail: Page 
583
    583
  • Thumbnail: Page 
584
    584
  • Thumbnail: Page 
585
    585
  • Thumbnail: Page 
586
    586
  • Thumbnail: Page 
587
    587
  • Thumbnail: Page 
588
    588
  • Thumbnail: Page 
589
    589