Sciweavers

MLQ
2006

The strength of sharply bounded induction

14 years 12 days ago
The strength of sharply bounded induction
We prove that the sharply bounded arithmetic T0 2 in a language containing the function symbol x
Emil Jerábek
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where MLQ
Authors Emil Jerábek
Comments (0)