Post's theorem
E1578110
UNEXPLORED
Post's theorem is a fundamental result in computability theory that characterizes the arithmetical hierarchy by relating levels of definability to the Turing jump operation.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Post's theorem canonical | 1 |
| Post’s theorem | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T23281203 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Post's theorem Context triple: [Rice's theorem, relatedTo, Post's theorem]
-
A.
Rice's theorem
Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
-
B.
Löb's theorem
Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
-
C.
Tarski's undefinability theorem
Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
Kleene’s recursion theorem
Kleene’s recursion theorem is a fundamental result in computability theory that guarantees the existence of self-referential programs, allowing a program to effectively obtain and use its own description.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Post's theorem Target entity description: Post's theorem is a fundamental result in computability theory that characterizes the arithmetical hierarchy by relating levels of definability to the Turing jump operation.
-
A.
Rice's theorem
Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
-
B.
Löb's theorem
Löb's theorem is a fundamental result in mathematical logic that characterizes when a sufficiently strong formal system can prove statements about its own provability, closely refining the insights of Gödel’s incompleteness theorems.
-
C.
Tarski's undefinability theorem
Tarski's undefinability theorem is a fundamental result in mathematical logic showing that, in sufficiently strong formal systems, the notion of truth for the language of the system cannot be defined within that same language.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
Kleene’s recursion theorem
Kleene’s recursion theorem is a fundamental result in computability theory that guarantees the existence of self-referential programs, allowing a program to effectively obtain and use its own description.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.