Loading...

A counterexample to polynomially bounded realizability of basic arithmetic

Ardeshir, M ; Sharif University of Technology | 2019

171 Viewed
  1. Type of Document: Article
  2. DOI: 10.1215/00294527-2019-0013
  3. Publisher: Duke University Press , 2019
  4. Abstract:
  5. We give a counterexample to the claim that every provably total function of Basic Arithmetic is a polynomially bounded primitive recursive function. © 2019 by University of Notre Dame
  6. Keywords:
  7. Basic arithmetic ; Polynomially bounded realizability ; Primitive recursive realizability
  8. Source: Notre Dame Journal of Formal Logic ; Volume 60, Issue 3 , 2019 , Pages 481-489 ; 00294527 (ISSN)
  9. URL: https://projecteuclid.org/euclid.ndjfl/1562205626