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.
Some Strongly Undecidable Natural Arithmetical Problems, with an Application to Intuitionistic Theories
The Journal of Symbolic Logic
Vol. 68, No. 1 (Mar., 2003), pp. 262-266
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/4147741
Page Count: 5
You can always find the topics here!Topics: Mathematical problems, Diophantine equation, Recursively enumerable sets, Intuitionistic type theory, Mathematics, Diophantine sets, Arithmetic, Mathematical logic, Mathematical sets, Infinity
Were these topics helpful?See somethings 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
The Journal of Symbolic Logic © 2003 Association for Symbolic Logic