scientific article; zbMATH DE number 432701

MaRDI QIDQ3138828zbMATH OpenFDO

Authors Helmut Schwichtenberg

Publication date 11 November 1993

zbMATH Keywords

Howard ordinalPeano arithmeticprogram-extraction systemprovably recursive functionsslow-growing hierarchy

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) First-order arithmetic and fragments (03F30)

Recommendations

• scientific article; zbMATH DE number 1215495
• scientific article; zbMATH DE number 176743
• Extraction and verification of programs by analysis of formal proofs
• scientific article; zbMATH DE number 5269066
• scientific article; zbMATH DE number 2006631

Cited in

(19)

• A slow growing analogue to Buchholz' proof
• Total sets and objects in domain theory
• Well-ordering proofs for Martin-Löf type theory
• Proofs as processes
• Proofs and programs
• Type-theoretic approaches to ordinals
• Proofs and computations
• scientific article; zbMATH DE number 176743 (Why is no real title available?)
• scientific article; zbMATH DE number 2006631 (Why is no real title available?)
• scientific article; zbMATH DE number 806754 (Why is no real title available?)
• Proof-theoretic notions for software maintenance
• From programming-by-example to proving-by-example
• What Is the Difference Between Proofs and Programs?
• A machine program for theorem-proving
• Intrinsic reasoning about functional programs. I: First order theories
• Program extraction from classical proofs
• Proof methods of declarative properties of definite programs
• Schwichtenberg's style analysis of parameter-free fragments of Girard's system F
• Formal proof of a program: find

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