scientific article; zbMATH DE number 3497886

zbMATH Open0318.02047MaRDI QIDQ4079601FDOQ4079601

Authors: Helmut Schwichtenberg 

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (9)

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

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)