scientific article; zbMATH DE number 806754

zbMath0864.03037MaRDI QIDQ4850555

Helmut Schwichtenberg, Stanley S. Wainer

Publication date: 15 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

proof theoryordinal notationssemanticscomputable functionscollapsingBachmann-Howard ordinalprovably recursive functionsproofs as programsslow-growing hierarchyfixed-point constructorprogram-constructors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Recursive ordinals and ordinal notations (03F15)

Related Items (4)

Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ The hierarchy of terminating recursive programs over N ⋮ Finite notations for infinite terms ⋮ \({\mathcal M}^\omega\) considered as a programming language

This page was built for publication: