Triple

T1266616
Position Surface form Disambiguated ID Type / Status
Subject von Neumann–Bernays–Gödel set theory E15613 entity
Predicate isWeakerThan P24324 FINISHED
Object Morse–Kelley set theory (in proof-theoretic strength) E91147 NE FINISHED

How this triple was built (3 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: Morse–Kelley set theory (in proof-theoretic strength) | Statement: [von Neumann–Bernays–Gödel set theory, isWeakerThan, Morse–Kelley set theory (in proof-theoretic strength)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Morse–Kelley set theory (in proof-theoretic strength)
Context triple: [von Neumann–Bernays–Gödel set theory, isWeakerThan, Morse–Kelley set theory (in proof-theoretic strength)]
  • A. Morse–Kelley set theory by class–set distinction chosen
    Morse–Kelley set theory by class–set distinction is a foundational system that avoids certain set-theoretic paradoxes by rigorously distinguishing between sets and proper classes within a powerful axiomatic framework.
  • B. von Neumann–Bernays–Gödel set theory
    Von Neumann–Bernays–Gödel set theory is an axiomatic set theory extending Zermelo–Fraenkel set theory by formally distinguishing between sets and classes, widely used in foundational studies of mathematics.
  • C. Zermelo set theory
    Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
  • D. Zermelo–Fraenkel set theory
    Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
  • E. 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.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: isWeakerThan
Context triple: [von Neumann–Bernays–Gödel set theory, isWeakerThan, Morse–Kelley set theory (in proof-theoretic strength)]
  • A. weakerThan chosen
    Indicates that one entity has less strength, power, or effectiveness than another entity.
  • B. isStrongerThan
    Indicates that one entity possesses greater physical power, force, or effectiveness than another entity.
  • C. strongerThan
    Indicates that one entity possesses greater strength, power, or intensity than another.
  • D. hasLessFinancialPowersThan
    Indicates that one entity’s authority or capacity to make financial decisions or control financial resources is lower or more limited than that of another entity.
  • E. isLessEfficientThan
    Indicates that one entity performs a task or uses resources with lower efficiency compared to another entity.
  • F. None of above.

Provenance (4 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_69a4935a94308190bb92555b79032824 completed March 1, 2026, 7:28 p.m.
NER Named-entity recognition batch_69a4c037f14c8190baa42f70f8846583 completed March 1, 2026, 10:39 p.m.
NED1 Entity disambiguation (via context triple) batch_69acbf1fa1148190a8a8a5b3e34946f0 completed March 8, 2026, 12:13 a.m.
PD Predicate disambiguation batch_69a4bede52a081909665d60acbe41d31 completed March 1, 2026, 10:34 p.m.
Created at: March 1, 2026, 7:50 p.m.