Basic proof theory with applications to computation

MaRDI QIDQ4357068zbMATH OpenFDO

Authors Stanley S. Wainer

Publication date 7 October 1997

zbMATH Keywords

elementary proof theorysurvey

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03)

Review text

This paper surveys some elementary proof theory. It deals with completeness of first-order logic, natural deduction, typed lambda-calculus, sequent calculus, cut elimination and primitive recursion, including Gödel's system T. For the entire collection see [Zbl 0869.00051].

Cited in

(2)

• scientific article; zbMATH DE number 941039 (Why is no real title available?)
• Techniques of computable set theory with applications to proof verification

This page was built for publication: Basic proof theory with applications to computation

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