Partial realizations of Hilbert's program
From MaRDI portal
Recommendations
Cited in
(38)- Taking formalism seriously
- 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
- Some remarks on Hilbert's program
- A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
- 1997–98 Annual Meeting of the Association for Symbolic Logic
- Consistency, models, and soundness
- The constructive Hilbert program and the limits of Martin-Löf type theory
- Truth, reflection and hierarchies
- On the concept of finitism
- A simple proof of Parsons' theorem
- Reverse mathematics, Young diagrams, and the ascending chain condition
- The meaning of pure mathematics
- Finitization procedures and finite model property
- The Borel complexity of isomorphism for o-minimal theories
- Proof theory in philosophy of mathematics
- We shall know: Hilbert's apology
- Objectivity and truth in mathematics: a sober non-Platonist perspective
- scientific article; zbMATH DE number 4103066 (Why is no real title available?)
- Reverse mathematics and its meaning
- Predicativity and Feferman
- Denying Infinity: Pragmatism in Abraham Robinson’s Philosophy of Mathematics
- How can a line segment with extension be composed of extensionless points? From Aristotle to Borel, and beyond
- Two (or three) notions of finitism
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
- The ignorance of Bourbaki
- On Relating Theories: Proof-Theoretical Reduction
- Periodic points and subsystems of second-order arithmetic
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors
- The mathematical universe
- Hilbert's program revisited
- The prehistory of the subsystems of second-order arithmetic
- Ordered Groups: A Case Study in Reverse Mathematics
- Hilbert versus Hindman
- Predicativity and constructive mathematics
- Foundations of mathematics: an optimistic message
- Different senses of finitude: an inquiry into Hilbert's finitism
- Things that can and things that cannot be done in PRA
- Understanding uniformity in Feferman's explicit mathematics
This page was built for publication: Partial realizations of Hilbert's program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799998)