Two (or three) notions of finitism
From MaRDI portal
Publication:3550708
Recommendations
Cites work
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 1150714 (Why is no real title available?)
- A Formalization of Recursive Arithmetic
- Combinatorial principles in elementary number theory
- Functional interpretations of feasibly constructive arithmetic
- Hilbert's Programs: 1917–1922
- Hilbert's program and the omega-rule
- Hilbert's ‘Verunglückter Beweis’, the first epsilon theorem, and consistency proofs
- Logic-free formalisations of recursive arithmetic
- On Grzegorczyk induction
- Partial realizations of Hilbert's program
- Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
- Ternary Recursive Arithmetic.
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Cited in
(9)- scientific article; zbMATH DE number 5054077 (Why is no real title available?)
- Finitistic arithmetic and classical logic
- Strict finitism and the happy sorites
- Finiteness and choice
- On the concept of finitism
- Explicit finitism
- Strict finitism, feasibility, and the sorites
- What Hilbert and Bernays meant by ``finitism
- scientific article; zbMATH DE number 1870429 (Why is no real title available?)
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)