scientific article; zbMATH DE number 3403733
From MaRDI portal
Publication:5670174
zbMath0255.68014MaRDI QIDQ5670174
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Proof theory and constructive mathematics (03F99)
Related Items
A strong induction scheme that leads to polynomially computable realizations, Innovations in computational type theory using Nuprl, Intuitionistic formal theories with realizability in subrecursive classes, Intuitionistic completeness of first-order logic, A bridge between constructive logic and computer programming, The logical meaning of programs of a subrecursive language, Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic, Programs as proofs: A synopsis, Constructing specification morphisms
