A proof-theoretic characterization of the basic feasible functionals (Q706620): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2004.08.009
@@ Property / DOI: 10.1016/j.tcs.2004.08.009 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.08.009
+Normal rank
@@ Property / OpenAlex ID @@
+W1973440844
@@ Property / OpenAlex ID: W1973440844 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3342534
@@ Property / cites work: Q3342534 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3679172
@@ Property / cites work: Q3679172 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757915
@@ Property / cites work: Q3757915 / rank @@
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Higher type recursion, ramification and polynomial time
+Normal rank
@@ Property / cites work @@
+Q3800030
@@ Property / cites work: Q3800030 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5702663
@@ Property / cites work: Q5702663 / rank @@
+Normal rank
@@ Property / cites work @@
+Polytime, combinatory logic and positive safe induction
+Normal rank
@@ Property / cites work @@
+Q4934292
@@ Property / cites work: Q4934292 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035304
@@ Property / cites work: Q4035304 / rank @@
+Normal rank
@@ Property / cites work @@
+Functional interpretations of feasibly constructive arithmetic
+Normal rank
@@ Property / cites work @@
+Q4128540
@@ Property / cites work: Q4128540 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3882452
@@ Property / cites work: Q3882452 / rank @@
+Normal rank
@@ Property / cites work @@
+Logic and Computation
@@ Property / cites work: Logic and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3773876
@@ Property / cites work: Q3773876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4722037
@@ Property / cites work: Q4722037 / rank @@
+Normal rank
@@ Property / cites work @@
+On characterizations of the basic feasible functionals, Part I
+Normal rank
@@ Property / cites work @@
+A new Characterization of Type-2 Feasibility
@@ Property / cites work: A new Characterization of Type-2 Feasibility / rank @@
+Normal rank
@@ Property / cites work @@
+A foundational delineation of poly-time
@@ Property / cites work: A foundational delineation of poly-time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501154
@@ Property / cites work: Q4501154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850553
@@ Property / cites work: Q4850553 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411835
@@ Property / cites work: Q4411835 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial and abstract subrecursive classes
@@ Property / cites work: Polynomial and abstract subrecursive classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218943
@@ Property / cites work: Q4218943 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals
+Normal rank
@@ Property / cites work @@
+Theories with self-application and computational complexity.
+Normal rank
@@ Property / cites work @@
+Constructivism in mathematics. An introduction. Volume II
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2004.08.009
@@ Property / DOI: 10.1016/J.TCS.2004.08.009 / rank @@
+Normal rank