Hilbert's program and the omega-rule

DOI10.2307/2275269zbMath0820.03002OpenAlexW2129433923MaRDI QIDQ4292612

Aleksandar Ignjatović

Publication date: 11 September 1995

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

Full work available at URL: https://doi.org/10.2307/2275269

zbMATH Keywords

metamathematicsprimitive recursive arithmeticlogical foundationsmathematical proofsexact philosophyconsistency of formal rulesfinitist proofs

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Philosophical and critical aspects of logic and foundations (03A05) History of mathematical logic and foundations (03-03)

Related Items (5)

TWO (OR THREE) NOTIONS OF FINITISM ⋮ On the concept of finitism ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ An open formalism against incompleteness ⋮ Extensions of the Finitist Point of View

Cites Work

• Fragments of arithmetic
• Foundations for analysis and proof theory
• Countable algebra and set existence axioms
• Die Grundlegung der elementaren Zahlenlehre
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• Hilbert's program relativized; Proof-theoretical and foundational reductions

This page was built for publication: Hilbert's program and the omega-rule