Feasible functionals and intersection of ramified types
From MaRDI portal
Recommendations
- Some applications of logic to feasibility in higher types
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- On characterizations of the basic feasible functionals. I
- scientific article; zbMATH DE number 176200
- scientific article; zbMATH DE number 806755
Cites work
- A new Characterization of Type-2 Feasibility
- A new recursion-theoretic characterization of the polytime functions
- Functional interpretations of feasibly constructive arithmetic
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 65741 (Why is no real title available?)
- scientific article; zbMATH DE number 176200 (Why is no real title available?)
- scientific article; zbMATH DE number 176211 (Why is no real title available?)
- scientific article; zbMATH DE number 1948174 (Why is no real title available?)
- scientific article; zbMATH DE number 806752 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- On characterizations of the basic feasible functionals. I
- Polynomial and abstract subrecursive classes
- Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
This page was built for publication: Feasible functionals and intersection of ramified types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842842)
