Triple

T3380931
Position Surface form Disambiguated ID Type / Status
Subject Alfred Tarski E71180 entity
Predicate knownFor P22 FINISHED
Object Tarski’s fixed point theorem
Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
E353628 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: Tarski’s fixed point theorem | Statement: [Alfred Tarski, knownFor, Tarski’s fixed point theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Tarski’s fixed point theorem
Context triple: [Alfred Tarski, knownFor, Tarski’s fixed point theorem]
  • A. Kakutani fixed-point theorem
    The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
  • B. Glicksberg fixed-point theorem
    The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
  • C. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • D. Ky Fan’s lemma
    Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
  • E. Kripke fixed-point theory of truth
    The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar 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: Tarski’s fixed point theorem
Triple: [Alfred Tarski, knownFor, Tarski’s fixed point theorem]
Generated description
Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Tarski’s fixed point theorem
Target entity description: Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
  • A. Kakutani fixed-point theorem
    The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
  • B. Glicksberg fixed-point theorem
    The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
  • C. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • D. Ky Fan’s lemma
    Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
  • E. Kripke fixed-point theory of truth
    The Kripke fixed-point theory of truth is a semantic framework developed by Saul Kripke that uses partial truth predicates and fixed points to consistently handle self-referential sentences and semantic paradoxes like the liar 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_69ad85a7f80c8190a05e43013f298942 completed March 8, 2026, 2:20 p.m.
NER Named-entity recognition batch_69adb5e7c7f48190afb78c311b424c93 completed March 8, 2026, 5:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69b3344f9b448190aab1038ead60fa48 completed March 12, 2026, 9:46 p.m.
NEDg Description generation batch_69b338147cc0819095f00b28910e178a completed March 12, 2026, 10:03 p.m.
NED2 Entity disambiguation (via description) batch_69b338967c6c819090fe5f77bfa1978f completed March 12, 2026, 10:05 p.m.
Created at: March 8, 2026, 3:14 p.m.