Pages that link to "Item:Q639690"
From MaRDI portal
The following pages link to The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690):
Displaying 4 items.
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- Realisability in weak systems of explicit mathematics (Q3107339) (← links)
