On a hitherto unexploited extension of the finitary standpoint

DOI10.1007/BF00247744zbMath0433.03040OpenAlexW9785351MaRDI QIDQ1139043

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)

Related Items

A herbrandized functional interpretation of classical first-order logic, A dialectica-like model of linear logic, Classical (co)recursion: Mechanics, About primitive recursive algorithms, Unnamed Item, System \(T\), call-by-value and the minimum problem, A Computational Interpretation of Forcing in Type Theory