Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-28T01:44:35.948Z Has data issue: false hasContentIssue false
  • English
  • Français

U. Berger, W. Buchholz, and H. Schwichtenberg. Refined program extraction from classical proofs. Annals of pure and applied logic, vol. 114 (2002), pp. 3–25.

Published online by Cambridge University Press:  15 January 2014

N. Danner
N. Danner*
Affiliation:
Department of Mathematics and Computer Science, Wesleyan University, Middletown, CT 06457, USA.ndanner@member.ams.org.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 9 , Issue 1 , March 2003 , pp. 47 - 48
Copyright
Copyright © Association for Symbolic Logic 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)