Triple
T11736266
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Barkley Rosser |
E279033
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Kleene–Rosser paradox
The Kleene–Rosser paradox is a logical contradiction in untyped lambda calculus that demonstrated the inconsistency of Alonzo Church’s original formulation of the system.
|
E943473
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Kleene–Rosser paradox | Statement: [Barkley Rosser, notableWork, Kleene–Rosser paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kleene–Rosser paradox Context triple: [Barkley Rosser, notableWork, Kleene–Rosser paradox]
-
A.
Grelling–Nelson paradox
The Grelling–Nelson paradox is a self-referential logical paradox arising from classifying adjectives as "autological" or "heterological," leading to a contradiction when considering whether "heterological" describes itself.
-
B.
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.
-
C.
Berry paradox
The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.
-
D.
Russell’s paradox
Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
-
E.
Barber paradox
The Barber paradox is a self-referential logical puzzle about a barber who shaves all and only those who do not shave themselves, illustrating a contradiction similar to Russell’s paradox.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Kleene–Rosser paradox Triple: [Barkley Rosser, notableWork, Kleene–Rosser paradox]
Generated description
The Kleene–Rosser paradox is a logical contradiction in untyped lambda calculus that demonstrated the inconsistency of Alonzo Church’s original formulation of the system.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kleene–Rosser paradox Target entity description: The Kleene–Rosser paradox is a logical contradiction in untyped lambda calculus that demonstrated the inconsistency of Alonzo Church’s original formulation of the system.
-
A.
Grelling–Nelson paradox
The Grelling–Nelson paradox is a self-referential logical paradox arising from classifying adjectives as "autological" or "heterological," leading to a contradiction when considering whether "heterological" describes itself.
-
B.
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.
-
C.
Berry paradox
The Berry paradox is a self-referential logical paradox arising from phrases like “the smallest positive integer not definable in under eleven words,” which appears to define exactly such a number while claiming it cannot be defined.
-
D.
Russell’s paradox
Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
-
E.
Barber paradox
The Barber paradox is a self-referential logical puzzle about a barber who shaves all and only those who do not shave themselves, illustrating a contradiction similar to Russell’s paradox.
- F. None of above. chosen
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d6aaffec6881908bead509e8621742 |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d8a4edced48190b7a59dd45921828e |
completed | April 10, 2026, 7:21 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f019b318188190bfb7effcf42974d2 |
completed | April 28, 2026, 2:21 a.m. |
| NEDg | Description generation | batch_69f0319271788190a105828ae7582668 |
completed | April 28, 2026, 4:03 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69f05a44dcb88190a0bb57b0c8fef6b9 |
completed | April 28, 2026, 6:57 a.m. |
Created at: April 8, 2026, 9:41 p.m.