Characterising polytime through higher type recursion

, &
Annals of Pure and Applied Logic 104 (1-3):17-30 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(00)00006-3

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

mathrm {K} $-H. Niggl, and H. Schwichtenberg. Higher type recursion, ramification and polynomial time.S. J. Bellantoni - 2000 - Annals of Pure and Applied Logic 104 (1-3):17-30.
Helmut Schwichtenberg. Finite notations for infinite terms. Annals of pure and applied logic, vol. 94 , pp. 201–222. [REVIEW]Herman Ruge Jervell - 2000 - Bulletin of Symbolic Logic 6 (4):477-477.
Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the polytime functions. Computational complexity, vol. 2 , pp. 97–110. - Arnold Beckmann and Andreas Weiermann. A term rewriting characterization of the polytime functions and related complexity classes. Archive for mathematical logic, vol. 36 , pp. 11–30. [REVIEW]Karl-Heinz Niggl - 2000 - Bulletin of Symbolic Logic 6 (3):351-353.
On church's formal theory of functions and functionals: The λ-calculus: connections to higher type recursion theory, proof theory, category theory.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
Herbrand's theorem as higher order recursion.Bahareh Afshari, Stefan Hetzl & Graham E. Leigh - 2020 - Annals of Pure and Applied Logic 171 (6):102792.
Elementary arithmetic.Geoffrey E. Ostrin & Stanley S. Wainer - 2005 - Annals of Pure and Applied Logic 133 (1):275-292.
Higher type recursion, ramification and polynomial time.Stephen J. Bellantoni, Karl-Heinz Niggl & Helmut Schwichtenberg - 2000 - Annals of Pure and Applied Logic 104 (1-3):17-30.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
1-Generic degrees and minimal degrees in higher recursion theory, II.C. T. Chong - 1986 - Annals of Pure and Applied Logic 31:165-175.
TERLOUW, J., Reduction of higher type levels by means of an ordinal analysis of finite terms WOOD, C., see SARACINO, D.D. Saracino - 1985 - Annals of Pure and Applied Logic 28 (1):322.

Analytics

Added to PP
2014-03-20

Downloads
11 (#1,150,279)

6 months
9 (#439,104)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A new "feasible" arithmetic.Stephen Bellantoni & Martin Hofmann - 2002 - Journal of Symbolic Logic 67 (1):104-116.
Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.

Add more citations

References found in this work

The realm of primitive recursion.Harold Simmons - 1988 - Archive for Mathematical Logic 27 (2):177-188.

Add more references