Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
0 answers
109 views

Computational complexity of arithmetic sentences over classical theories

Below, I use the term "tracker" rather than "realizer" since I'm not requiring the relevant objects to be computable. Define the relation "$f$ tracks $\varphi$" for $f:\...
Noah Schweber's user avatar
4 votes
0 answers
292 views

the strength of saying "each sentence of true arithmetic has a recursive proof"

Let $PA_{\omega}$ be just like $PA$ except that $PA_{\omega}$-proofs can use any number of applications of the recursive $\omega$-rule. The recursive $\omega$-rule allows the following: For each ...
Haidar's user avatar
  • 449