A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Unprovability of consistency statements in fragments of bounded arithmetic
1995
Annals of Pure and Applied Logic
This paper deals with the weak fragments of arithmetic P V and S i 2 and their induction-free fragments P V − and S −1
doi:10.1016/0168-0072(94)00049-9
fatcat:rjf74dqd7nejtfiqt67hxtvmx4