Triple
T6370788
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Church–Rosser property |
E143338
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | property of rewriting systems |
C20338
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: property of rewriting systems Context triple: [Church–Rosser property, instanceOf, property of rewriting systems]
-
A.
automated theorem proving technique
An automated theorem proving technique is a systematic, algorithmic method used by computer programs to derive logical conclusions and verify the validity of mathematical or logical statements without human intervention.
-
B.
hierarchy of formal grammars
A hierarchy of formal grammars is an organized classification of grammars into levels based on their generative power and structural constraints, such as the Chomsky hierarchy from regular to recursively enumerable languages.
-
C.
problem in invariant theory
A problem in invariant theory concerns determining and characterizing the algebraic functions (invariants) that remain unchanged under the action of a given group on a vector space or algebraic variety.
-
D.
Weyl algebra
The Weyl algebra is the associative algebra generated by variables and their corresponding differential operators subject to canonical commutation relations, typically modeling the algebraic structure of quantum mechanical observables.
-
E.
logic for concurrent systems
Logic for concurrent systems is a formal framework for specifying and reasoning about the behaviors, interactions, and correctness properties of systems in which multiple processes execute and communicate simultaneously.
- F. None of above. chosen
Provenance (1 batch)
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_69c008d8c61081908bcaf61510d881ed |
completed | March 22, 2026, 3:20 p.m. |
Created at: March 22, 2026, 4:33 p.m.