A proof-theoretic characterization of the basic feasible functionals
type: Item
instance of: scholarly article
title: A proof-theoretic characterization of the basic feasible functionals
zbMATH Open document ID: 1086.03044
author: Thomas Strahm
published in: Theoretical Computer Science
publication date: 2005-02-09T00:00:00Z
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 03D65
Mathematics Subject Classification ID: 03F25
zbMATH DE Number: 2132498
zbMATH Keywords: basic feasible functionals
zbMATH Keywords: applicative theories
zbMATH Keywords: proof theory
zbMATH Keywords: type-two feasibility
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.08.009
OpenAlex ID: W1973440844
cites work: Q3342534
cites work: Q3679172
cites work: Q3757915
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Higher type recursion, ramification and polynomial time
cites work: Q3800030
cites work: Q5702663
cites work: Polytime, combinatory logic and positive safe induction
cites work: Q4934292
cites work: Q4035304
cites work: Functional interpretations of feasibly constructive arithmetic
cites work: Q4128540
cites work: Q3882452
cites work: Logic and Computation
cites work: Q3773876
cites work: Q4722037
cites work: On characterizations of the basic feasible functionals. I
cites work: A new Characterization of Type-2 Feasibility
cites work: A foundational delineation of poly-time
cites work: Q4501154
cites work: Q4850553
cites work: Q4411835
cites work: Polynomial and abstract subrecursive classes
cites work: Q4218943
cites work: Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
cites work: Theories with self-application and computational complexity.
cites work: Constructivism in mathematics. An introduction. Volume II
DOI: 10.1016/J.TCS.2004.08.009
description: scientific article; zbMATH DE number 2132498