Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories

Journal of Symbolic Logic 68 (1):262-266 (2003)
Abstract
A natural problem from elementary arithmetic which is so strongly undecidable that it is not even Trial and Error decidable (in other words, not decidable in the limit) is presented. As a corollary, a natural, elementary arithmetical property which makes a difference between intuitionistic and classical theories is isolated.
Keywords Undecidability  Logic  Intuitionism
Categories (categorize this paper)
DOI 10.2178/jsl/1045861513
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
101 ( #52,164 of 2,197,326 )

Recent downloads (6 months)
10 ( #20,184 of 2,197,326 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature