A note on the Entscheidungsproblem
From MaRDI portal
Publication:5763293
DOI10.2307/2269326zbMath0014.38503OpenAlexW2064811181WikidataQ55886413 ScholiaQ55886413MaRDI QIDQ5763293
Publication date: 1936
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2269326
Related Items
On decidability of the theory with the transitive closure operator, 2011 North American Annual Meeting of the Association for Symbolic Logic, Turing-machines and the Entscheidungsproblem, The incompleteness theorems after 70 years, Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer, Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?, Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version, When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science, Satisfiability of formulae with one \(\forall\) is decidable in exponential time, Tiling problems and undecidability in the cluster variation method., Computability and Recursion, Automated theorem provers: a practical tool for the working mathematician?, Step by Recursive Step: Church's Analysis of Effective Calculability, Conceptual Confluence in 1936: Post and Turing, Algorithms: From Al-Khwarizmi to Turing and Beyond, Why Turing’s Thesis Is Not a Thesis, On the Unusual Effectiveness of Logic in Computer Science, Alonzo church:his life, his work and some of his miracles, On the Complexity of RSRL, Gödel's reception of Turing's model of computability: the shift of perception in 1934, ECONOPHYSICS AND ECONOMIC COMPLEXITY, Correction to A note on the Entscheidungsproblem, HEINRICH BEHMANN’S 1921 LECTURE ON THE DECISION PROBLEM AND THE ALGEBRA OF LOGIC, Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski, On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate, A Natural Axiomatization of Computability and Proof of Church's Thesis, Undecidability of First-Order Intuitionistic and Modal Logics with Two variables, Structuring and automating hardware proofs in a higher-order theorem- proving environment, Expressivity and Complexity of Dependence Logic, Learning programs by learning from failures, Contributions to the reduction theory of the decision problem, The number of finitely axiomatizable completions, Contributions to the reduction theory of the decision problem, Contributions to the reduction theory of the decision problem, Completeness: from Gödel to Henkin, Turing oracle machines, online computing, and three displacements in computability theory, Encoding many-valued logic in $\lambda$-calculus, Observations on Computability, Uncertainty, and Technology, Automated theorem proving methods, New methods for computing inferences in first order logic
Cites Work
