scientific article; zbMATH DE number 3497886

MaRDI QIDQ4079601zbMATH OpenFDO

Authors Helmut Schwichtenberg

Publication date 1975

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Proof theory and constructive mathematics (03F99)

Cited in

(9)

• Combinatory logic with polymorphic types
• A direct proof of Schwichtenberg's bar recursion closure theorem
• Reduction of higher type levels by means of an ordinal analysis of finite terms
• A view of programming languages as symbiosis of meaning and computations
• Characterizing complexity classes by higher type primitive recursive definitions
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
• Finite notations for infinite terms
• Herbrand analyses
• A plus-1 theorem for subsections

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079601)