Hilbert's Twenty-Fourth Problem
From MaRDI portal
Recommendations
Cited in
(37)- Remarks on Hilbert's 23rd problem
- Discussing Hilbert's 24th problem
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- Larry Wos: visions of automated reasoning
- Axiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic Semantics
- Hilbert's twenty-fourth problem
- Explanation in mathematical conversations: an empirical investigation
- Reshaping the metaphor of proof
- Hilbert's last problem
- Variants of Gödel's ontological proof in a natural deduction calculus
- Feasibly constructive proofs of succinct weak circuit lower bounds
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF
- Mathematics made in Germany: on the background to Hilbert's Paris lecture
- Proofs as Objects
- On a generalization of Hilbert's 21st problem
- Identity of Proofs Based on Normalization and Generality
- The finitistic dimension of a triangulated category
- Human-centered automated proof search
- Virtue theory of mathematical practices: an introduction
- From mathematical axioms to mathematical rules of proof: recent developments in proof analysis
- Prolegomena to any theory of proof simplicity
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- Hilbert’s Axiomatisches Denken
- The calculus of natural calculation
- The sampling theorem, Poisson's summation formula, general Parseval formula, reproducing kernel formula and the Paley-Wiener theorem for bandlimited signals -- their interconnections
- The Cantor-Bernstein theorem: how many proofs?
- Essential structure of proofs as a measure of complexity
- scientific article; zbMATH DE number 2024619 (Why is no real title available?)
- Identification of proofs via syzygies
- Visual thinking and simplicity of proof
- Controlling a population
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
- Simplicity: ideals of practice in mathematics and the arts. Proceedings of the conference, City University of New York, NY, USA, April 3--5, 2013
- Hilbert's problems, Kant, and decidability
- Combinatorial flows as bicolored atomic flows
- Proof simplification and automated theorem proving
- Hilbert and his twenty-four problems
This page was built for publication: Hilbert's Twenty-Fourth Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4416428)