Pages that link to "Item:Q1327386"
From MaRDI portal
The following pages link to A foundational delineation of poly-time (Q1327386):
Displaying 19 items.
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- A decidable characterization of the classes between lintime and exptime (Q1045888) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Light linear logic (Q1271560) (← links)
- A formal definition of time in LOTOS (Q1293890) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Polytime, combinatory logic and positive safe induction (Q1407533) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- A refined interpretation of intuitionistic logic by means of atomic polymorphism (Q2186692) (← links)
- Radical anti-realism, Wittgenstein and the length of proofs (Q2268776) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- Characterising polynomial time computable functions using theories with weak set existence principles (Q2843916) (← links)
- Elementary explicit types and polynomial time operations (Q3632522) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
