Feasible functionals and intersection of ramified types
From MaRDI portal
Publication:2842842
DOI10.1016/S1571-0661(04)80495-XzbMath1270.03066MaRDI QIDQ2842842
Publication date: 16 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Functional interpretations of feasibly constructive arithmetic
- A new recursion-theoretic characterization of the polytime functions
- Polynomial and abstract subrecursive classes
- On characterizations of the basic feasible functionals, Part I
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- POLYNOMIAL LOCAL SEARCH IN THE POLYNOMIAL HIERARCHY AND WITNESSING IN FRAGMENTS OF BOUNDED ARITHMETIC
- A new Characterization of Type-2 Feasibility
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Feasible functionals and intersection of ramified types