Strict finitism and feasibility

DOI10.1007/3-540-60178-3_76MaRDI QIDQ6064273

Felice Cardone

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

winning strategylogical proofElementary derivationnotre dame Journalsymbolic configuration

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What evidence is there that \(2^{\land}65536\) is a natural number?
• Strict finitism
• Wang's paradox
• Remarks on the completeness of logical systems relative to the validity- concepts of P. Lorenzen and K. Lorenz
• EIGHTY YEARS OF FOUNDATIONAL STUDIES
• Why Gödel didn't have church's thesis
• A formalization of Essenin-Volpin's proof theoretical studies by means of nonstandard analysis
• ON THE DOGMA OF THE NATURAL NUMBERS
• Ad Infinitum... The Ghost in Turing's Machine
• Paths, Trees, and Flowers
• On Mathematical Induction
• Existence and feasibility in arithmetic