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