Two (or three) notions of finitism
DOI10.1017/S1755020309990323zbMATH Open1206.03005OpenAlexW2105434830MaRDI QIDQ3550708FDOQ3550708
Authors: 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
Recommendations
equational theoryfinitismKalmar elementary functionsalgebra of lower elementary functionsequational arithmeticfinitistic arithmetic
Philosophical and critical aspects of logic and foundations (03A05) Philosophy of mathematics (00A30) First-order arithmetic and fragments (03F30)
Cites Work
- Title not available (Why is that?)
- Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
- Hilbert's Programs: 1917–1922
- Partial realizations of Hilbert's program
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Title not available (Why is that?)
- Hilbert's program and the omega-rule
- A Formalization of Recursive Arithmetic
- 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
- Ternary Recursive Arithmetic.
- Logic-free formalisations of recursive arithmetic
Cited In (9)
This page was built for publication: Two (or three) notions of finitism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550708)