Pages that link to "Item:Q1407533"
From MaRDI portal
The following pages link to Polytime, combinatory logic and positive safe induction (Q1407533):
Displaying 12 items.
- The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- A foundational delineation of poly-time (Q1327386) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Realisability in weak systems of explicit mathematics (Q3107339) (← links)
- Pointwise Transfinite Induction and a Miniaturized Predicativity (Q3305563) (← links)
- Elementary explicit types and polynomial time operations (Q3632522) (← links)
- Tiered Arithmetics (Q5214784) (← links)
- On the proof theory of type two functionals based on primitive recursive operations (Q5485397) (← links)