A note on the Entscheidungsproblem

DOI10.2307/2269326zbMATH Open0014.38503OpenAlexW2064811181WikidataQ55886413 ScholiaQ55886413MaRDI QIDQ5763293FDOQ5763293

Authors: Alonzo Church 

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

zbMATH Keywords

logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Zum Entscheidungsproblem des logischen Funktionenkalküls

Cited In (42)

• Expressivity and Complexity of Dependence Logic
• On decidability of the theory with the transitive closure operator
• 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
• Gödel's reception of Turing's model of computability: the shift of perception in 1934
• Turing-machines and the Entscheidungsproblem
• Heinrich Behmann's 1921 lecture on the decision problem and the algebra of logic
• On the Complexity of RSRL
• Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski
• Tiling problems and undecidability in the cluster variation method.
• Algorithms: From Al-Khwarizmi to Turing and Beyond
• Computability and Recursion
• The incompleteness theorems after 70 years
• Observations on Computability, Uncertainty, and Technology
• Title not available (Why is that?)
• New methods for computing inferences in first order logic
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time
• On the unusual effectiveness of logic in computer science
• Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
• On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate
• When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
• Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer
• The internal logic and finite colimits
• Turing oracle machines, online computing, and three displacements in computability theory
• Learning programs by learning from failures
• Step by Recursive Step: Church's Analysis of Effective Calculability
• Conceptual Confluence in 1936: Post and Turing
• The number of finitely axiomatizable completions
• Contributions to the reduction theory of the decision problem
• Alonzo church:his life, his work and some of his miracles
• Structuring and automating hardware proofs in a higher-order theorem- proving environment
• Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version
• Encoding many-valued logic in $\lambda$-calculus
• Automated theorem proving methods
• Completeness: from Gödel to Henkin
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Correction to A note on the Entscheidungsproblem
• Automated theorem provers: a practical tool for the working mathematician?
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• ECONOPHYSICS AND ECONOMIC COMPLEXITY
• Why Turing’s Thesis Is Not a Thesis
• Contributions to the reduction theory of the decision problem
• Contributions to the reduction theory of the decision problem

This page was built for publication: A note on the Entscheidungsproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5763293)