Correction to A note on the Entscheidungsproblem
@article{Church1936CorrectionTA,
title={Correction to A note on the Entscheidungsproblem},
author={Alonzo Church},
journal={Journal of Symbolic Logic},
year={1936},
volume={1},
pages={101 - 102},
url={https://api.semanticscholar.org/CorpusID:5557237}
}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).
38 Citations
On the Remarkable Features of Binding Forms
- 2014
Mathematics, Philosophy
A new kind of classification based on the binding forms that are admitted in a sentence, i.e., on the way the arguments of a relation can be bound to a variable is introduced, showing that the less expressive one is already incomparable with the guarded logic and related extensions.
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving*
- 1983
Computer Science, Mathematics
This paper is concerned with a portion of the theory underlying an extension of this line of development to systems — first-order theories with equality — in which there is a distinguished relation symbol for equality.
From Solvability to Formal Decidability: Revisiting Hilbert’s “Non-Ignorabimus”
- 2019
Philosophy, Mathematics
The topic of this article is Hilbert’s axiom of solvability, that is, his conviction of the solvability of every mathematical problem by means of a finite number of operations. The question of…
Lambda calculus and Functional Programming
- 2000
Computer Science
Write explicitely as lambda-abstractions (including parentheses, dots, etc.), with all parentheses, with only necessary parentheses, and reduce KII, which explains a difference between relations = a ≡ and c.
Related Citations
- 1937
Philosophy
chief objection to interpreting general propositions, even ideally, as conjunctions and disjunctions. Suppose that we could write down an infinite conjunction or disjunction. That would be of no use,…
A Natural Axiomatization of Church's Thesis
- 2007
Computer Science
It is proved that augmenting those postulates with an additional requirement regarding basic operations implies Church’s Thesis, namely, that the only numeric functions that can be calculated by effective means are the recursive ones (which are the same, extensionally, as the Turing-computable numeric functions).
On the Decision Problem for Two-Variable First-Order Logic
- 1997
Mathematics, Computer Science
Abstract We identify the computational complexity of the satisfiability problem for FO2, the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct…
Turing-machines and the Entscheidungsproblem
- 1962
Mathematics
Let Q be the set of all sentences of elementary quantification theory (without equality). In its semantic version Hilbert’s Entscheidungsproblem for a class X ⊇ Q of sentences is, [X]: To find a…
Meaning, Reality and Algorithms: Implications of the Turing Theorem
- 1997
Mathematics, Philosophy
The task Hilbert had indicated, namely the reduction of mathematics to logic through the process of axiomatisation and the formulation of a method to answer mechanically any mathematical question, has been proved to be unfeasible.
Conceptual Confluence in 1936: Post and Turing
- 2015
Philosophy
It is argued that the unity of their approach is of deep significance for the theory of computability and not to be viewed as a surprising coincidence, but rather as a natural consequence of the way in which Post and Turing conceived of the steps in mechanical procedures on finite strings.
2 References
A note on the Entscheidungsproblem
- 1936
Mathematics, Philosophy
It is shown 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.
An Unsolvable Problem of Elementary Number Theory
- 1936
Mathematics
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use…