Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
type: Item
instance of: scholarly article
title: Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)
zbMATH Open document ID: 1166.03018
author: Lars Kristiansen
published in: Theory of Computing Systems
publication date: 2009-05-08T00:00:00Z
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5552167
zbMATH Keywords: complexity theory
zbMATH Keywords: subrecursive classes
zbMATH Keywords: types
zbMATH Keywords: \(\lambda\)-calculi
zbMATH Keywords: Gödel's \(T\)
MaRDI profile type: Publication
full work available at URL: s00224-007-9021-x
OpenAlex ID: W2084909062
cites work: Q4215634
cites work: Q4934292
cites work: Polynomial functions with exponentiation are well ordered
cites work: Rudimentary relations and primitive recursion: A toolbox
cites work: Some Relations between Classes of Low Computational Complexity
cites work: Q3979266
cites work: Characterizing complexity classes by higher type primitive recursive definitions
cites work: Q5824357
cites work: The expressive power of higher-order types or, life without CONS
cites work: Neat function algebraic characterizations of LOGSPACE and LINSPACE
cites work: Logical Approaches to Computational Barriers
cites work: New Computational Paradigms
cites work: Complexity classes and fragments of C
cites work: Computer Science Logic
cites work: Q3370734
cites work: Theory and Applications of Models of Computation
cites work: Small Grzegorczyk Classes
cites work: An ordinal bound for the set of polynomial functions with exponentiation
cites work: Classical recursion theory. Vol. II
cites work: Q3689182
cites work: Classes of Predictably Computable Functions
cites work: Q4934291
cites work: Q3241196
DOI: 10.1007/S00224-007-9021-X
description: scientific article; zbMATH DE number 5552167