Triple
T31646836
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | System F |
E807603
|
entity |
| Predicate | decidabilityOfTyping |
P91856
|
FINISHED |
| Object | undecidable in general |
—
|
LITERAL 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: undecidable in general | Statement: [System F, decidabilityOfTyping, undecidable in general]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: decidabilityOfTyping Context triple: [System F, decidabilityOfTyping, undecidable in general]
-
A.
decidability
chosen
Indicates whether a given problem, property, or statement can be algorithmically determined to be true or false for all possible inputs.
-
B.
turingComplete
Indicates that a system or language is capable of performing any computation that a universal Turing machine can, given enough time and memory.
-
C.
provedUndecidableUsing
Indicates that the undecidability of one problem, theory, or statement was established by applying or reducing it to another specific method, result, or formal system.
-
D.
compilerType
Indicates the specific kind or category of compiler associated with or used by an entity.
-
E.
hasUndecidableStatement
Indicates that a formal system or theory possesses at least one statement whose truth or falsity cannot be determined within that system using its axioms and rules of inference.
- F. None of above.
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_69f348d9ce58819093ea2da83cbeeec1 |
completed | April 30, 2026, 12:19 p.m. |
| NER | Named-entity recognition | batch_69f6a91f65548190b598917dada0c2c0 |
completed | May 3, 2026, 1:47 a.m. |
| PD | Predicate disambiguation | batch_69f6a757c6e081908e37631e5d8d246b |
completed | May 3, 2026, 1:39 a.m. |
Created at: April 30, 2026, 10:51 p.m.