Hilbert's Twenty-Fourth Problem

From MaRDI portal
Publication:4416428

DOI10.2307/3072340zbMath1031.01011OpenAlexW3145855177MaRDI QIDQ4416428

Ruediger Thiele

Publication date: 3 August 2003

Published in: The American Mathematical Monthly (Search for Journal in Brave)

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




Related Items (27)

Variants of Gödel's ontological proof in a natural deduction calculusHilbert’s Axiomatisches DenkenAxiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic SemanticsProofs as ObjectsUnnamed ItemUnnamed ItemMathematics made in Germany: on the background to Hilbert's Paris lectureEssential structure of proofs as a measure of complexityCombinatorial flows as bicolored atomic flowsVirtue theory of mathematical practices: an introductionThe sampling theorem, Poisson's summation formula, general Parseval formula, reproducing kernel formula and the Paley–Wiener theorem for bandlimited signals – their interconnectionsIdentity of Proofs Based on Normalization and GeneralityTowards Hilbert's 24th Problem: Combinatorial Proof InvariantsFeasibly constructive proofs of succinct weak circuit lower boundsThe Cantor–Bernstein theorem: how many proofs?Visual thinking and simplicity of proofProof simplification and automated theorem provingProlegomena to any theory of proof simplicityThe problem of proof identity, and why computer scientists should care about Hilbert's 24th problemDiscussing Hilbert's 24th problemExplanation in mathematical conversations: an empirical investigationIdentification of proofs via syzygiesReshaping the metaphor of proofThe calculus of natural calculationHuman-centered automated proof searchNATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZFLarry Wos: visions of automated reasoning







This page was built for publication: Hilbert's Twenty-Fourth Problem