Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with theories-of-arithmetic
Search options not deleted
user 163672
Theories of arithmetic in first-order logic, such as Peano arithmetic, second-order arithmetic, Heyting arithmetic, and their subsystems and extensions. Models of Peano arithmetic.
9
votes
1
answer
473
views
What can $I\Delta_0$ prove?
What combinatorial and number-theoretic propositions can $I\Delta_0$ prove? Obviously there are an infinitude of them, but what are some well known theorems that can be proved in $I\Delta_0$, if any?
- 675
17
votes
3
answers
3k
views
Did Edward Nelson accept the incompleteness theorems?
Edward Nelson advocated weak versions of arithmetic (called predicative arithmetic) that couldn't prove the totality of exponentiation. Since his theory extends Robinson arithmetic, the incompleteness …
- 675
4
votes
0
answers
545
views
Can Robinson arithmetic prove any interesting theorems?
The motivation for my question is I'm curious whether studying Robinson arithmetic can be fruitful in the same sense as studying group theory. Robinson arithmetic is so weak that there are many struct …
- 675
3
votes
0
answers
191
views
Set theories that are complete modulo finite-order arithmetic
In a previous question, I asked whether there can be effectively axiomatizable set theories (at least as strong as, say, ZF) that are complete modulo first-order arithmetic, to which the answer is no; …
- 675