Complexity-Theoretic Hierarchies-Reference-Cited by-同舟云学术

Complexity-Theoretic Hierarchies

Published:2006 Issue: Volume: Page:279-288
ISSN:0302-9743
Container-title:Logical Approaches to Computational Barriers
language:
Short-container-title:

Author:

Kristiansen Lars

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11780342_30

Reference25 articles.

1. Avigad, J., Feferman, S.: Gödel’s functional interpretation. In: Buss, S. (ed.) Handbook of Proof Theory. Elsevier, Amsterdam (1998)

2. Bel’tyukov, A.: A machine description and the hierarchy of initial Grzegorczyk classes. J. Soviet Math (1982), Zap. Naucn. Sem. Leninigrad. Otdel. May. Inst. Steklov (LOMI) 88, 30–46 (1982)

3. Clote, P.: Computation models and function algebra. In: Griffor, E. (ed.) Handbook of Computability Theory. Elsevier, Amsterdam (1996)

4. Ehrenfeucht, A.: Polynomial functions with exponentiation are well ordered. Algebra Universalis 3, 261–262 (1973)

5. Esbelin, M.A., More, M.: Rudimentary relations and primitive recursion: A toolbox. Theoretical Computer Science 193, 129–148 (1998)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-determinism in Gödel’s System T;Theory of Computing Systems;2011-11-24

2. Observation of implicit complexity by non confluence;Electronic Proceedings in Theoretical Computer Science;2010-05-05

3. A domain model characterising strong normalisation;Annals of Pure and Applied Logic;2008-11

4. Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T;Theory of Computing Systems;2007-07-04

5. Recursion in Higher Types and Resource Bounded Turing Machines;Logic and Theory of Algorithms