knownResult
P28576
predicate
Indicates that the outcome or consequence of an action, process, or event is already determined and available.
All labels observed (2)
| Label | Occurrences |
|---|---|
| knownResult canonical | 18 |
| resultsAre | 1 |
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: knownResult
Generated description
Indicates that the outcome or consequence of an action, process, or event is already determined and available.
Sample triples (19)
| Subject | Object |
|---|---|
| Noether's problem | for many finite abelian groups over algebraically closed fields of characteristic zero the answer is yes ⓘ |
| Noether's problem | there exist finite groups for which the answer to Noether's problem is no ⓘ |
| Noether's problem | Swan constructed counterexamples over the rational numbers ⓘ |
| Noether's problem | Endo and Miyata obtained positive results for certain abelian groups ⓘ |
| Noether's problem |
Voskresenskii studied Noether's problem via algebraic tori
ⓘ
linked to:
Noether's problem
|
| Noether's problem |
Bogomolov used the unramified Brauer group to produce counterexamples
ⓘ
linked to:
Noether's problem
|
| Navier–Stokes existence and smoothness problem | global weak solutions exist in three dimensions (Leray solutions) ⓘ |
| Navier–Stokes existence and smoothness problem | global smooth solutions exist in two dimensions ⓘ |
| Navier–Stokes existence and smoothness problem | local-in-time smooth solutions exist in three dimensions ⓘ |
| Conway's thrackle conjecture | the conjecture is proved for several special classes of graphs ⓘ |
| Conway's thrackle conjecture | upper bounds better than 2n for the number of edges in a thrackle are known ⓘ |
| Conway's thrackle conjecture | linear upper bounds on the number of edges in a thrackle have been established ⓘ |
| Happy Ending problem | f(3) = 3 ⓘ |
| Happy Ending problem | f(4) = 5 ⓘ |
| Happy Ending problem | f(5) = 9 ⓘ |
| Happy Ending problem | f(6) = 17 ⓘ |
| Erdős–Moser equation | (k,m) = (1,2) is the only solution with k ≤ 1 ⓘ |
| Erdős–Moser equation | no solutions are known with k>1 ⓘ |
| SMT-COMP | publicly available via predicate surface "resultsAre" ⓘ |