Pages that link to "Item:Q1377631"
From MaRDI portal
The following pages link to Intuitionistic formal theories with realizability in subrecursive classes (Q1377631):
Displaying 4 items.
- A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time (Q937902) (← links)
- A strong induction scheme that leads to polynomially computable realizations (Q1885030) (← links)
- Theory of computational complexity. Part 8. Transl. from the Russian (Q2577628) (← links)
- Elementary explicit types and polynomial time operations (Q3632522) (← links)