Switch to: References

Add citations

You must login to add citations.
  1. A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic.Mohammad Ardeshir, Erfan Khaniki & Mohsen Shahriari - 2019 - Notre Dame Journal of Formal Logic 60 (3):481-489.
    We give a counterexample to the claim that every provably total function of Basic Arithmetic is a polynomially bounded primitive recursive function.
    Direct download (3 more)  
    Export citation