Lev D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of pure and applied logic, vol. 85 , pp. 193–242 [Book Review]

Bulletin of Symbolic Logic 8 (2):302-303 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1182353877

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,462

External links

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

Through your library

My notes

Similar books and articles

Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
Matt Fairtlough and Stanley S. Wainer. Hierarchies of provably recursive functions. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 149–207. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):466-467.
Helmut Schwichtenberg. Finite notations for infinite terms. Annals of pure and applied logic, vol. 94 , pp. 201–222. [REVIEW]Herman Ruge Jervell - 2000 - Bulletin of Symbolic Logic 6 (4):477-477.

Analytics

Added to PP
2016-06-30

Downloads
28 (#671,784)

6 months
6 (#693,786)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Volker Halbach
Oxford University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references