On a hitherto unexploited extension of the finitary standpoint

DOI10.1007/BF00247744MaRDI QIDQ1139043zbMATH OpenOpenAlexFDO

Authors Kurt Gödel

Publication date 1980

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00247744

zbMATH Keywords

computable function of finite simple typeconsistency of classical number theoryfinitary standpoint

Mathematics Subject Classification ID

Collected or selected works; reprintings or translations of classics (01A75) Metamathematics of constructive systems (03F50)

Cited in

(8)

• About primitive recursive algorithms
• System \(T\), call-by-value and the minimum problem
• A herbrandized functional interpretation of classical first-order logic
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• A dialectica-like model of linear logic
• A computational interpretation of forcing in type theory
• Classical (co)recursion: Mechanics
• A contextual formalization of structural coinduction

This page was built for publication: On a hitherto unexploited extension of the finitary standpoint

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