Bulletin of Symbolic Logic

Review: Lev D. Beklemishev, Induction Rules, Reflection Principles, and Provably Recursive Functions

Volker Halbach
Source: Bull. Symbolic Logic Volume 8, Number 2 (2002), 302-303.
First Page: Show Hide

Reviewed Works:

Lev D. Beklemishev, Induction Rules, Reflection Principles, and Provably Recursive Functions.

Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.bsl/1182353877
JSTOR: links.jstor.org
Digital Object Identifier: doi:10.2178/bsl/1182353877


2013 © Association for Symbolic Logic

Bulletin of Symbolic Logic

Bulletin of Symbolic Logic

Turn MathJax Off
What is MathJax?