Burgess' PV Is Robinson's Q

Journal of Symbolic Logic 72 (2):619 - 624 (2007)
  Copy   BIBTEX

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 that PV, the simplest such theory, is equivalent to Robinson's arithmetical theory Q

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-08-24

Downloads
55 (#259,775)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Mihai Ganea
University of Toronto, St. George Campus

Citations of this work

Comparing Peano arithmetic, Basic Law V, and Hume’s Principle.Sean Walsh - 2012 - Annals of Pure and Applied Logic 163 (11):1679-1709.
The predicative Frege hierarchy.Albert Visser - 2009 - Annals of Pure and Applied Logic 160 (2):129-153.
The Strength of Abstraction with Predicative Comprehension.Sean Walsh - 2016 - Bulletin of Symbolic Logic 22 (1):105–120.
Term Models for Abstraction Principles.Leon Horsten & Øystein Linnebo - 2016 - Journal of Philosophical Logic 45 (1):1-23.
Sir Michael Anthony Eardley Dummett, 1925-2011.R. G. Heck - 2013 - Philosophia Mathematica 21 (1):1-8.

View all 8 citations / Add more citations

References found in this work

Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro (ed.), Oxford Handbook of Philosophy of Mathematics and Logic. Oxford: Oxford University Press. pp. 590-624.
John P. Burgess, Fixing Frege. [REVIEW]Pierre Swiggers - 2006 - Tijdschrift Voor Filosofie 68 (3):665-665.

Add more references