provedUndecidableUsing
P53737
predicate
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| provedUndecidableUsing canonical | 3 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: provedUndecidableUsing
Generated description
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.
Sample triples (3)
| Subject | Object |
|---|---|
| Entscheidungsproblem | lambda calculus ⓘ |
| Entscheidungsproblem |
Turing machine
ⓘ
surface form:
Turing machines
|
| Entscheidungsproblem | reduction from the halting problem ⓘ |