scientific article; zbMATH DE number 3403733

MaRDI QIDQ5670174zbMATH OpenFDO

Authors Robert Constable

Publication date 1972

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03F99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(9)

• Programs as proofs: A synopsis
• A bridge between constructive logic and computer programming
• The logical meaning of programs of a subrecursive language
• Constructing specification morphisms
• Intuitionistic formal theories with realizability in subrecursive classes
• Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic
• A strong induction scheme that leads to polynomially computable realizations
• Intuitionistic completeness of first-order logic
• Innovations in computational type theory using Nuprl

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