Burgess’PVis Robinson’sQ
Mihai Ganea · Journal of Symbolic Logic · 2007
Abstract In [2] John Burgess describes predicative versions of Frege's logic and poses the problem of finding their exact arithmetical strength. I prove here thatPV, the simplest such theory, is equivalent to Robinson's arithmetical theoryQ.