In mathematics and computer science, the Entscheidungsproblem
(pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm], German for "decision
problem") is a challenge posed by
Contents 1 History of the problem 2 Negative answer 3 Practical decision procedures 4 See also 5 Notes 6 References 7 External links History of the problem[edit]
The origin of the
Automated theorem proving Hilbert's second problem Oracle machine Turing's proof Notes[edit] ^ Hilbert and Ackermann
^ Church's paper was presented to the American Mathematical Society on
19 April 1935 and published on 15 April 1936. Turing, who had made
substantial progress in writing up his own results, was disappointed
to learn of Church's proof upon its publication (see correspondence
between
References[edit]
External links[edit] The dictionary definition of entscheidungsproblem at Wiktionary v t e Mathematical logic General Formal language Formation rule Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Rule of inference Relation Theorem Logical consequence Type theory Symbol Syntax Theory Systems Formal system Deductive system Axiomatic system Hilbert style systems Natural deduction Sequent calculus Traditional logic Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram Propositional calculus Boolean logic Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Many-valued logic Predicate logic First-order Quantifiers Predicate Second-order Monadic predicate calculus Naive set theory Set Empty set Element Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Codomain Image Map Function Relation Ordered pair Set theory Foundations of mathematics
Zermelo–Fraenkel set theory
Model theory Model Interpretation Non-standard model Finite model theory Truth value Validity Proof theory Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax Computability theory Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function v t e Metalogic Metamathematics Cantor's theorem Entscheidungsproblem Church–Turing thesis Consistency Effective method Foundations of mathematics (geometry) Gödel's completeness theorem Gödel's incompleteness theorems Soundness Completeness Decidability Interpretation Löwenheim–Skolem theorem Metatheorem Satisfiability Independence Type–token distinction Use–m |