You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
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
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2274871
Page Count: 14
You can always find the topics here!Topics: String, Logical theorems, Arithmetic, Mathematical functions, Mathematical theorems, Truth condition, Quantification, Recursion theory, Mathematical logic, Mathematical induction
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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.
The Journal of Symbolic Logic © 1989 Association for Symbolic Logic