scientific article; zbMATH DE number 3497886
From MaRDI portal
Publication:4079601
zbMath0318.02047MaRDI QIDQ4079601
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hierarchies of computability and definability (03D55) Proof theory and constructive mathematics (03F99)
Related Items
A view of programming languages as symbiosis of meaning and computations ⋮ Combinatory logic with polymorphic types ⋮ Herbrand analyses ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ A plus-1 theorem for subsections ⋮ A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM ⋮ Characterizing complexity classes by higher type primitive recursive definitions ⋮ Reduction of higher type levels by means of an ordinal analysis of finite terms ⋮ Finite notations for infinite terms
This page was built for publication:
