Triple

T4165863
Position Surface form Disambiguated ID Type / Status
Subject ZF E84442 entity
Predicate isFormalizedIn P31448 FINISHED
Object Hilbert-style deductive systems
Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
E418216 NE FINISHED

How this triple was built (5 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: Hilbert-style deductive systems | Statement: [ZF, isFormalizedIn, Hilbert-style deductive systems]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hilbert-style deductive systems
Context triple: [ZF, isFormalizedIn, Hilbert-style deductive systems]
  • A. Recherches sur la théorie de la démonstration
    Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
  • B. New Foundations for Mathematical Logic
    New Foundations for Mathematical Logic is W.V.O. Quine’s influential essay proposing an alternative set theory, known as "New Foundations," aimed at resolving paradoxes while preserving a broad, intuitive universe of sets.
  • C. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • D. On a Problem of Formal Logic
    "On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
  • E. Tarski’s theorem on the completeness of elementary algebra and geometry
    Tarski’s theorem on the completeness of elementary algebra and geometry is a foundational result in mathematical logic showing that the first-order theory of real closed fields (capturing elementary algebra and Euclidean geometry) is complete, decidable, and admits quantifier elimination.
  • 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: Hilbert-style deductive systems
Triple: [ZF, isFormalizedIn, Hilbert-style deductive systems]
Generated description
Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hilbert-style deductive systems
Target entity description: Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • A. Recherches sur la théorie de la démonstration
    Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
  • B. New Foundations for Mathematical Logic
    New Foundations for Mathematical Logic is W.V.O. Quine’s influential essay proposing an alternative set theory, known as "New Foundations," aimed at resolving paradoxes while preserving a broad, intuitive universe of sets.
  • C. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • D. On a Problem of Formal Logic
    "On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
  • E. Tarski’s theorem on the completeness of elementary algebra and geometry
    Tarski’s theorem on the completeness of elementary algebra and geometry is a foundational result in mathematical logic showing that the first-order theory of real closed fields (capturing elementary algebra and Euclidean geometry) is complete, decidable, and admits quantifier elimination.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: isFormalizedIn
Context triple: [ZF, isFormalizedIn, Hilbert-style deductive systems]
  • A. isFormalizedBy
    Indicates that something is given a defined, structured, or official form through a specific method, process, or representation.
  • B. formalizedUnder chosen
    Indicates that something has been officially established, defined, or codified within the framework, authority, or provisions of a particular formal system, agreement, or institution.
  • C. formalizedAt
    Indicates the point in time or event at which something is officially established, documented, or given formal status.
  • D. termFormalizedBy
    Indicates that a given term has been formally defined, specified, or codified by a particular formalization (such as a formal theory, document, or system).
  • E. cessionFormalizedBy
    Indicates that a transfer or cession of rights, territory, or control is officially established, confirmed, or made legally binding by a specific formal act or instrument.
  • F. None of above.

Provenance (6 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_69aed932cab48190b80ffe35f7029ae1 completed March 9, 2026, 2:29 p.m.
NER Named-entity recognition batch_69af02ac8e788190a8f3563a2903bbad completed March 9, 2026, 5:26 p.m.
NED1 Entity disambiguation (via context triple) batch_69b57f478c948190a997e006015e588d completed March 14, 2026, 3:31 p.m.
NEDg Description generation batch_69b57fcd3d60819086ab5ad7b69242a2 completed March 14, 2026, 3:33 p.m.
NED2 Entity disambiguation (via description) batch_69b5803ec2088190ac9d4b3d34278e17 completed March 14, 2026, 3:35 p.m.
PD Predicate disambiguation batch_69af018fb0948190a9701b2e8e5d9bac completed March 9, 2026, 5:21 p.m.
Created at: March 9, 2026, 3:44 p.m.