Hilbert’s program

Target entity: Hilbert’s program
Context triple: [David Hilbert, notableWork, Hilbert’s program]

• A. On Computable Numbers with an Application to the Entscheidungsproblem
  "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
• B. Frege’s system in "Grundgesetze der Arithmetik"
  Frege’s system in "Grundgesetze der Arithmetik" is a foundational logical framework for arithmetic based on second-order logic and Basic Law V, whose inconsistency—revealed by Russell’s paradox—marked a turning point in the development of modern logic and set theory.
• C. Church–Turing thesis
  The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
• D. Principia Mathematica
  Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
• E. von Neumann–Bernays–Gödel set theory
  Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Hilbert’s program
Target entity description: Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.

• A. On Computable Numbers with an Application to the Entscheidungsproblem
  "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
• B. Frege’s system in "Grundgesetze der Arithmetik"
  Frege’s system in "Grundgesetze der Arithmetik" is a foundational logical framework for arithmetic based on second-order logic and Basic Law V, whose inconsistency—revealed by Russell’s paradox—marked a turning point in the development of modern logic and set theory.
• C. Church–Turing thesis
  The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
• D. Principia Mathematica
  Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
• E. von Neumann–Bernays–Gödel set theory
  Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
• F. None of above. chosen