TWO (OR THREE) NOTIONS OF FINITISM

DOI10.1017/S1755020309990323zbMath1206.03005OpenAlexW2105434830MaRDI QIDQ3550708

Mihai Ganea

Publication date: 1 April 2010

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1755020309990323

zbMATH Keywords

equational theoryfinitismKalmar elementary functionsalgebra of lower elementary functionsequational arithmeticfinitistic arithmetic

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) First-order arithmetic and fragments (03F30)

Related Items (2)

STRICT FINITISM, FEASIBILITY, AND THE SORITES ⋮ On the concept of finitism

Cites Work

• Unnamed Item
• Unnamed Item
• Functional interpretations of feasibly constructive arithmetic
• Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
• Combinatorial principles in elementary number theory
• On Grzegorczyk induction
• Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
• Partial realizations of Hilbert's program
• Hilbert's Programs: 1917–1922
• Hilbert's program and the omega-rule
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Ternary Recursive Arithmetic.
• A Formalization of Recursive Arithmetic
• Logic-free formalisations of recursive arithmetic

This page was built for publication: TWO (OR THREE) NOTIONS OF FINITISM