Pages that link to "Item:Q817959"
From MaRDI portal
The following pages link to Polynomially bounded recursive realizability (Q817959):
Displaying 5 items.
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- A strong induction scheme that leads to polynomially computable realizations (Q1885030) (← links)
- A counterexample to polynomially bounded realizability of basic arithmetic (Q2330507) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- Provably total functions of Basic Arithmetic (Q4808473) (← links)