%0 Generic %1 buss1995unprovability %A Buss, Samuel R. %A Ignjatovic, Aleksandar %D 1995 %K consistency unprovability %T Unprovability of Consistency Statements in Fragments of Bounded Arithmetic %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6350 %X This paper deals with the weak fragments of arithmetic PV and S and their induction-free fragments PV - and S -1 2 . We improve the bootstrapping of S 2 , which allows us to show that the theory S 2 can be axiomatized by the set of axioms BASIC together with any of the following induction schemas: # 1 -PIND , # 1 -PIND or # 1 -LIND .

@misc{buss1995unprovability, abstract = {This paper deals with the weak fragments of arithmetic PV and S and their induction-free fragments PV - and S -1 2 . We improve the bootstrapping of S 2 , which allows us to show that the theory S 2 can be axiomatized by the set of axioms BASIC together with any of the following induction schemas: # 1 -PIND , # 1 -PIND or # 1 -LIND .}, added-at = {2014-12-24T07:47:00.000+0100}, author = {Buss, Samuel R. and Ignjatovic, Aleksandar}, biburl = {https://www.bibsonomy.org/bibtex/2bfb96bc1c64788f8d89c3fe1d7a6f08f/t.uemura}, description = {CiteSeerX — Unprovability of Consistency Statements in Fragments of Bounded Arithmetic}, interhash = {345acd215dd1bfb000357342ca08a346}, intrahash = {bfb96bc1c64788f8d89c3fe1d7a6f08f}, keywords = {consistency unprovability}, timestamp = {2014-12-24T07:47:00.000+0100}, title = {Unprovability of Consistency Statements in Fragments of Bounded Arithmetic}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6350}, year = 1995 }