weakerThan
P24324
predicate
Indicates that one entity has less strength, power, or effectiveness than another entity.
All labels observed (23)
| Label | Occurrences |
|---|---|
| isWeakerThan | 30 |
| weakerThan canonical | 20 |
| lessRestrictiveThan | 9 |
| lessExpressiveThan | 5 |
| isLessRestrictiveThan | 4 |
| hasLowerEnduranceThan | 3 |
| hasLowerForcingThan | 3 |
| hasWeakerForm | 2 |
| isLessReliableThan | 2 |
| lessEffectiveAgainst | 2 |
| lessEffectiveOn | 2 |
| smallerForce | 2 |
| weakerTo | 2 |
| consideredLessSecureThan | 1 |
| hasWeakerRegularityAssumptionThan | 1 |
| isLessPowerfulThan | 1 |
| isWeakerIn | 1 |
| lessConservativeThan | 1 |
| poorerThan | 1 |
| usesWeakerConditionsThan | 1 |
| weakerAgainst | 1 |
| weakerAt | 1 |
| weakerConditionThan | 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: weakerThan
Generated description
Indicates that one entity has less strength, power, or effectiveness than another entity.
Sample triples (96)
| Subject | Object |
|---|---|
| Kripke–Platek set theory | Peano arithmetic plus certain transfinite induction principles via predicate surface "isWeakerThan" ⓘ |
| Cesàro summation | ordinary convergence of series via predicate surface "isWeakerThan" ⓘ |
| Form II Makashi | blaster fire via predicate surface "lessEffectiveAgainst" ⓘ |
| Form II Makashi | multiple opponents via predicate surface "lessEffectiveAgainst" ⓘ |
| Lindelöf hypothesis | Riemann Hypothesis via predicate surface "isWeakerThan" NERFINISHED ⓘ |
| Lindelöf space | compactness via predicate surface "isWeakerThan" ⓘ |
| Fermat primality test | Miller–Rabin primality test via predicate surface "isLessReliableThan" ⓘ |
| Fermat primality test | Solovay–Strassen primality test via predicate surface "isLessReliableThan" NERFINISHED ⓘ |
| Carathéodory existence theorem | Picard–Lindelöf theorem via predicate surface "usesWeakerConditionsThan" NERFINISHED ⓘ |
| Fornax Cluster | Virgo Cluster via predicate surface "poorerThan" NERFINISHED ⓘ |
| NFA | pushdown automaton via predicate surface "lessExpressiveThan" ⓘ |
| NFA | Turing machine via predicate surface "lessExpressiveThan" NERFINISHED ⓘ |
| Pólya’s conjecture | Mertens conjecture via predicate surface "isWeakerThan" ⓘ |
| OWL Lite | OWL DL via predicate surface "lessExpressiveThan" NERFINISHED ⓘ |
| OWL Lite | OWL Full via predicate surface "lessExpressiveThan" NERFINISHED ⓘ |
| Copernican principle (weak form) | strong Copernican principle ⓘ |
| Turing reducibility | many-one reducibility via predicate surface "isWeakerThan" ⓘ |
| Turing reducibility | one-one reducibility via predicate surface "isWeakerThan" ⓘ |
| Turing reducibility | truth-table reducibility via predicate surface "isWeakerThan" ⓘ |
| Wild Forest | Wilderness areas via predicate surface "lessRestrictiveThan" ⓘ |
| Wild Forest | Primitive areas via predicate surface "lessRestrictiveThan" ⓘ |
| Martin-Löf randomness | 2-randomness ⓘ |
| Linnik’s theorem on the least prime in an arithmetic progression | Generalized Riemann Hypothesis bounds for least primes in arithmetic progressions via predicate surface "isWeakerThan" ⓘ |
| RCP3-PD | RCP4.5 via predicate surface "hasLowerForcingThan" ⓘ |
| RCP3-PD | RCP6.0 via predicate surface "hasLowerForcingThan" ⓘ |
| RCP3-PD | RCP8.5 via predicate surface "hasLowerForcingThan" ⓘ |
| MLC (multi-level cell) | SLC (single-level cell) via predicate surface "hasLowerEnduranceThan" ⓘ |
| Busemann space | CAT(0) curvature condition via predicate surface "isWeakerThan" ⓘ |
| ESRB T | ESRB M via predicate surface "lessRestrictiveThan" NERFINISHED ⓘ |
| ESRB T | ESRB AO via predicate surface "lessRestrictiveThan" NERFINISHED ⓘ |
| Montel space | nuclear space (in many standard hierarchies) via predicate surface "isWeakerThan" ⓘ |
| Serre fibration | Hurewicz fibration via predicate surface "isWeakerThan" NERFINISHED ⓘ |
| T1 separation axiom | T2 separation axiom via predicate surface "isWeakerThan" ⓘ |
| T1 separation axiom | Hausdorff property via predicate surface "isWeakerThan" ⓘ |
|
Kolmogorov space (T0 space)
surface form:
Kolmogorov space
|
T1 space via predicate surface "isWeakerThan" ⓘ |
|
Kolmogorov space (T0 space)
surface form:
Kolmogorov space
|
Hausdorff space via predicate surface "isWeakerThan" ⓘ |
|
Kolmogorov space (T0 space)
surface form:
Kolmogorov space
|
T2 space via predicate surface "isWeakerThan" ⓘ |
|
Kolmogorov space (T0 space)
surface form:
Kolmogorov space
|
regular space via predicate surface "isWeakerThan" ⓘ |
|
Kolmogorov space (T0 space)
surface form:
Kolmogorov space
|
normal space via predicate surface "isWeakerThan" ⓘ |
| Liouville's inequality in Diophantine approximation | Roth's theorem via predicate surface "isWeakerThan" NERFINISHED ⓘ |
| Liouville's inequality in Diophantine approximation | Thue–Siegel–Roth theorem via predicate surface "isWeakerThan" NERFINISHED ⓘ |
| Dirichlet theorem on Fourier series | Carleson theorem on almost everywhere convergence of Fourier series NERFINISHED ⓘ |
| Dirichlet theorem on Fourier series | results assuming higher smoothness such as C^1 or C^2 periodic functions ⓘ |
| Carnage | sonic attacks via predicate surface "weakerTo" ⓘ |
| Carnage | extreme heat via predicate surface "weakerTo" ⓘ |
| Yellow Armor | Red Armor via predicate surface "isLessPowerfulThan" ⓘ |