- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
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 diļ¬erence between intuitionistic and classical theories is isolated.Author's Profile
Analytics
Added to PP
2009-01-28
Downloads
547 (#42,795)
6 months
100 (#53,220)
2009-01-28
Downloads
547 (#42,795)
6 months
100 (#53,220)
Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?
