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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

Induction Rules, Reflection Principles, and Provably Recursive Functions.Volker Halbach & Lev D. Beklemishev - 2002 - Bulletin of Symbolic Logic 8 (2):302.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
Local induction and provably total computable functions.Andrés Cordón-Franco & F. Félix Lara-Martín - 2014 - Annals of Pure and Applied Logic 165 (9):1429-1444.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
Some results on cut-elimination, provable well-orderings, induction and reflection.Toshiyasu Arai - 1998 - Annals of Pure and Applied Logic 95 (1-3):93-184.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
On the limit existence principles in elementary arithmetic and Σ n 0 -consequences of theories.Lev D. Beklemishev & Albert Visser - 2005 - Annals of Pure and Applied Logic 136 (1-2):56-74.
Paris-Harrington principles, reflection principles and transfinite induction up to epsilon 0.Reijiro Kurata - 1986 - Annals of Pure and Applied Logic 31:237.
On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness.Ulrich Kohlenbach - 1998 - Annals of Pure and Applied Logic 95 (1-3):257-285.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
Definitional Reflection and Basic Logic.Peter Schroeder-Heister - 2013 - Annals of Pure and Applied Logic 164 (4):491-501.
Leloup, G., Rings of monoids elementarily equivalent to polynomial rings Miller, C., Expansions of the real field with power functions Ozawa, M., Forcing in nonstandard analysis Rathjen, M., Proof theory of reflection. [REVIEW]L. D. Beklemishev, O. V. Belegradek, K. J. Davey & J. L. Krivine - 1994 - Annals of Pure and Applied Logic 68:343.

Analytics

Added to PP
2016-06-30

Downloads
23 (#670,971)

6 months
4 (#790,778)

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