The Undecidable
E238241
The Undecidable is a classic anthology edited by Martin Davis that collects foundational papers on computability, Gödel’s incompleteness theorems, and the limits of formal mathematical systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| The Undecidable canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2139623 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: The Undecidable Context triple: [Martin Davis, notableWork, The Undecidable]
-
A.
Forever Undecided
Forever Undecided is a logic puzzle book by Raymond Smullyan that playfully explores Gödel’s incompleteness theorems through self-referential riddles and dialogues.
-
B.
Gödel, Escher, Bach
Gödel, Escher, Bach is a Pulitzer Prize–winning interdisciplinary book by Douglas Hofstadter that explores deep connections between mathematics, art, music, and human consciousness.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
The Mind’s I
The Mind’s I is a philosophical anthology edited by Douglas Hofstadter and Daniel Dennett that explores consciousness, self, and identity through essays, stories, and thought experiments.
-
E.
Conjectures and Refutations
Conjectures and Refutations is a major philosophical work by Karl Popper that develops his theory of scientific knowledge through the ideas of falsifiability, critical testing, and the growth of knowledge via bold hypotheses and their refutation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: The Undecidable Target entity description: The Undecidable is a classic anthology edited by Martin Davis that collects foundational papers on computability, Gödel’s incompleteness theorems, and the limits of formal mathematical systems.
-
A.
Forever Undecided
Forever Undecided is a logic puzzle book by Raymond Smullyan that playfully explores Gödel’s incompleteness theorems through self-referential riddles and dialogues.
-
B.
Gödel, Escher, Bach
Gödel, Escher, Bach is a Pulitzer Prize–winning interdisciplinary book by Douglas Hofstadter that explores deep connections between mathematics, art, music, and human consciousness.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
The Mind’s I
The Mind’s I is a philosophical anthology edited by Douglas Hofstadter and Daniel Dennett that explores consciousness, self, and identity through essays, stories, and thought experiments.
-
E.
Conjectures and Refutations
Conjectures and Refutations is a major philosophical work by Karl Popper that develops his theory of scientific knowledge through the ideas of falsifiability, critical testing, and the growth of knowledge via bold hypotheses and their refutation.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
anthology
ⓘ
book ⓘ |
| aim |
to document the development of undecidability results in logic
ⓘ
to provide primary sources for the theory of computable functions ⓘ |
| containsWorkBy |
Alan Turing
ⓘ
Alfred Tarski ⓘ Alonzo Church ⓘ David Hilbert ⓘ Emil Post ⓘ Haskell Curry ⓘ J. Barkley Rosser ⓘ Jacques Herbrand ⓘ Kurt Gödel ⓘ Martin Davis ⓘ Moses Schönfinkel ⓘ Paul Bernays ⓘ Stephen Kleene ⓘ Thoralf Skolem ⓘ |
| editor | Martin Davis ⓘ |
| editorialMaterialBy | Martin Davis ⓘ |
| genre |
computability theory
ⓘ
mathematical logic ⓘ mathematics ⓘ |
| hasPart |
Church’s papers on the Entscheidungsproblem
ⓘ
Gödel’s 1931 incompleteness paper (in translation) ⓘ Kleene’s papers on recursive functions ⓘ Post’s papers on recursively enumerable sets ⓘ On Computable Numbers with an Application to the Entscheidungsproblem ⓘ
surface form:
Turing’s paper on computable numbers and the Entscheidungsproblem
|
| language | English ⓘ |
| notableFor |
collecting foundational papers on Gödel’s incompleteness theorems
ⓘ
collecting foundational papers on computability ⓘ collecting foundational papers on limits of formal mathematical systems ⓘ |
| status | classic anthology in logic and computability ⓘ |
| subject |
Gödel's incompleteness theorems
ⓘ
surface form:
Gödel’s incompleteness theorems
Hilbert’s program ⓘ computability ⓘ decision problem ⓘ formal systems ⓘ foundations of mathematics ⓘ recursion theory ⓘ undecidability ⓘ |
| targetAudience |
philosophers of mathematics
ⓘ
researchers in computability theory ⓘ students of mathematical logic ⓘ |
| usedAs |
reference work in courses on computability theory
ⓘ
reference work in courses on mathematical logic ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: The Undecidable Description of subject: The Undecidable is a classic anthology edited by Martin Davis that collects foundational papers on computability, Gödel’s incompleteness theorems, and the limits of formal mathematical systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.