Pages that link to "Item:Q3632522"
From MaRDI portal
The following pages link to Elementary explicit types and polynomial time operations (Q3632522):
Displaying 7 items.
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- Realisability in weak systems of explicit mathematics (Q3107339) (← links)
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158) (← links)
- Polynomial time equivalence types (Q3478393) (← links)
- Feasible Operations and Applicative Theories Based on λη (Q4511545) (← links)