论文信息 - Predicatively computable functions on sets

Predicatively computable functions on sets

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable set functions. Each function in this class is polynomial time computable when we restrict to finite binary strings.

Toshiyasu Arai | T. Arai

[1] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[2] Detlef Plump,et al. Term graph rewriting , 1999 .

[3] Ugo Dal Lago,et al. General Ramified Recurrence is Sound for Polynomial Time , 2010, DICE.

[4] Samuel R. Buss,et al. Safe Recursive Set Functions , 2015, J. Symb. Log..

[5] Daniel Leivant,et al. Stratified functional programs and computational complexity , 1993, POPL '93.

[6] Stephen A. Cook,et al. A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[7] Toshiyasu Arai,et al. Proofs of Termination of Rewrite Systems for Polytime Functions , 2005, FSTTCS.

[8] Jon Barwise,et al. Admissible sets and structures , 1975 .

[9] R. Jensen,et al. The fine structure of the constructible hierarchy , 1972 .

[10] Michael Rathjen. A Proof-Theoretic Characterization of the Primitive Recursive Set Functions , 1992, J. Symb. Log..