Switch to: References

Citations of:

Polynomially Bounded Recursive Realizability

Notre Dame Journal of Formal Logic 46 (4):407-417 (2005)

Add citations

You must login to add citations.

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.details We give a counterexample to the claim that every provably total function of Basic Arithmetic is a polynomially bounded primitive recursive function. Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Direct download (3 more) Export citation Bookmark

1