Concept
Entscheidungsproblem
Overview
in computer science, the impossible task of algorithmically determining whether a given statement is provable from the axioms
Overview adapted from Wikipedia (CC BY-SA 4.0; see the article history for authors).
Connections in the graph
These are recorded graph connections, not independently reviewed claims of influence, agreement, opposition or classification.
- First-order logic
- Frank P. Ramsey
- Evert Willem Beth
- Formal language
- Journal of Symbolic Logic
- Alan Turing
- Gottfried Wilhelm Leibniz
- Gödel's completeness theorem
- Truth value
- Kurt Gödel
- Mathematics
- Natural number
- Peano axioms
- Stephen Cole Kleene
- Turing machine
- Term logic
- Logical consequence
- Structure (mathematical logic)
- Deduction theorem
- Alonzo Church
- Computer science
- Gödel's incompleteness theorems
- Wilhelm Ackermann
- Church–Turing thesis
- Hilary Putnam
- Algorithm
- David Hilbert