A Note on the Entscheidungsproblem

@article{Church1936ANO,
  title={A Note on the Entscheidungsproblem},
  author={Alonzo Church},
  journal={J. Symb. Log.},
  year={1936},
  volume={1},
  pages={40-41}
}
  • A. Church
  • Published 1 June 1936
  • Mathematics
  • J. Symb. Log.
In a recent paper the author has proposed a definition of the commonly used term “effectively calculable” and has shown on the basis of this definition that the general case of the Entscheidungsproblem is unsolvable in any system of symbolic logic which is adequate to a certain portion of arithmetic and is ω-consistent. The purpose of the present note is to outline an extension of this result to the engere Funktionenkalkul of Hilbert and Ackermann. In the author's cited paper it is pointed out… 
Correction to A Note on the Entscheidungsproblem
TLDR
In order to correct an error, it is necessary to modify the “additional axioms” of the system L so that they contain no free variables (either free individual variables or free propositional function variables).
Completeness: from Gödel to Henkin
This paper focuses on the evolution of the notion of completeness in contemporary logic. We discuss the differences between the notions of completeness of a theory, the completeness of a calculus,
Recursively enumerable sets of positive integers and their decision problems
Introduction. Recent developments of symbolic logic have considerable importance for mathematics both with respect to its philosophy and practice. That mathematicians generally are oblivious to the
The Decision Problem
Alan Turing’s 1936 paper “On Computable Numbers with an Application to the Entscheidungsproblem” [3] proved most influential not only for mathematical logic, but also for the development of the
An Overview of the Computably Enumerable Sets
  • R. Soare
  • Computer Science, Mathematics
    Handbook of Computability Theory
  • 1999
Formal Logic
  • Miguel Palomino
  • Philosophy
    Wiley Encyclopedia of Computer Science and Engineering
  • 2008
TLDR
This trend started with a shift to a symbolic notation and artificial languages, and gradually evolved until, in 1933 with Tarski, it culminated with the withdrawal from an absolute notion of Truth and instead focused on the particular truths of concrete structures or models.
A Machine-Oriented Logic Based on the Resolution Principle
TLDR
The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
FROM THE IncOMIng cHaIR
An important link between model theory and proof theory is to construe a deductive disproof of S as an attempted construction of a countermodel to it. in the function logic outlined here, this idea
Contents Incomputability, Turing Functionals, and Open Computing
TLDR
One of the most important concepts in all of computability, Turing’s notion 1939 §4 of an oracle machine (o-machine) defines the computability of one set B relative to another set A which during the computation can be interrogated as a oracle (database).
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Sur la non-contradiction de l'Arithmétique.
Jacques Herbrand, geboren am 12. Februar 1908 in Paris, verunglückte tödlich bei einer Bergbesteigung in den Alpen am 27. Juli 1931. Am gleichen Tage ging das Manuskript der hier veröffentlichten
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
Jakina da Whiteheadek eta Russellek logika eta matematika eraiki dutela ageriko zenbait proposizio axiomatzat hartuz, eta horietatik, zehatz azaldutako inferentzia printzipioetan oinarrituz, logikako