Triple

T11736280
Position Surface form Disambiguated ID Type / Status
Subject Barkley Rosser E279033 entity
Predicate notableConcept P201 FINISHED
Object Kleene–Rosser paradox in lambda calculus E943473 NE FINISHED

How this triple was built (2 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 in lambda calculus | Statement: [Barkley Rosser, notableConcept, Kleene–Rosser paradox in lambda calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Kleene–Rosser paradox in lambda calculus
Context triple: [Barkley Rosser, notableConcept, Kleene–Rosser paradox in lambda calculus]
  • A. Kleene–Rosser paradox chosen
    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.
  • B. Curry–Howard correspondence
    The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
  • C. Kleene’s normal form theorem
    Kleene’s normal form theorem is a fundamental result in computability theory that characterizes all partial recursive (effectively computable) functions using a universal primitive recursive function and the μ-operator.
  • D. Church–Rosser property
    The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
  • E. Scheme: An Interpreter for Extended Lambda Calculus
    "Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69f0901a6ed481909054ddd581935ac4 completed April 28, 2026, 10:46 a.m.
Created at: April 8, 2026, 9:41 p.m.