Subrecursive hierarchies on Scott domains

DOI10.1007/BF01387405zbMath0779.03011OpenAlexW2041255733MaRDI QIDQ688507

Karl-Heinz Niggl

Publication date: 9 December 1993

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01387405

zbMATH Keywords

Scott domaineffective numberingextended Grzegorczyk classLifting classparallel bounded parallel \(\mu\)-operatorparallel computable functionspartial primitive recursive functionvariety of subrecursive hierarchies

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (3)

Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms ⋮ Computation models and function algebras ⋮ \({\mathcal M}^\omega\) considered as a programming language

Cites Work

• LCF considered as a programming language
• Classes of recursive functions based on Ackermann's function
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Unnamed Item
• Unnamed Item

This page was built for publication: Subrecursive hierarchies on Scott domains