scientific article; zbMATH DE number 806754

MaRDI QIDQ4850555zbMATH OpenFDO

Authors Helmut Schwichtenberg, Stanley S. Wainer

Publication date 15 June 1997

zbMATH Keywords

Bachmann-Howard ordinalcollapsingcomputable functionsfixed-point constructorordinal notationsprogram-constructorsproof theoryproofs as programsprovably recursive functionssemanticsslow-growing hierarchy

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 432701
• Complexity bounds for ordinal-based termination (invited talk)
• scientific article; zbMATH DE number 4016888
• A new system of proof-theoretic ordinal functions
• Ordinal complexity of recursive definitions

Cited in

(12)

• Finite notations for infinite terms
• \({\mathcal M}^\omega\) considered as a programming language
• A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity
• Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones
• Complexity bounds for ordinal-based termination (invited talk)
• Invariant inequalities in programs interpreted over an ordered field
• The recursion hierarchy for PCF is strict
• scientific article; zbMATH DE number 782031 (Why is no real title available?)
• Generalised dynamic ordinals -- universal measures for implicit computational complexity
• The hierarchy of terminating recursive programs over N
• Function definition in higher-order logic
• Schwichtenberg's style analysis of parameter-free fragments of Girard's system F

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 Q4850555)