appliesOver
P36369
predicate
Indicates that one entity’s effect, rule, or condition extends across or is valid for a specified range, domain, or set of entities.
All labels observed (3)
| Label | Occurrences |
|---|---|
| appliesOver canonical | 10 |
| genericOver | 5 |
| applicableOver | 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: appliesOver
Generated description
Indicates that one entity’s effect, rule, or condition extends across or is valid for a specified range, domain, or set of entities.
Sample triples (18)
| Subject | Object |
|---|---|
| Class A airspace | contiguous United States ⓘ |
| Class A airspace | most of Alaska ⓘ |
| Class A airspace | adjacent international waters within 12 NM of U.S. coast ⓘ |
| Malaysian airspace | territory of Malaysia ⓘ |
| Malaysian airspace | territorial waters of Malaysia ⓘ |
| PassthroughSubject | Output via predicate surface "genericOver" ⓘ |
| PassthroughSubject | Failure via predicate surface "genericOver" ⓘ |
| Result | Success via predicate surface "genericOver" ⓘ |
| Result | Failure via predicate surface "genericOver" ⓘ |
|
std::thread::spawn function
surface form:
std::thread::spawn
|
closure return type T via predicate surface "genericOver" ⓘ |
| Bombieri–Pila determinant method | real numbers ⓘ |
| Bombieri–Pila determinant method | rational numbers ⓘ |
| Bombieri–Pila determinant method | integers ⓘ |
| Fiscal Responsibility Law of Chile | economic cycle ⓘ |
| Euclidean algorithm for polynomials | fields via predicate surface "applicableOver" ⓘ |
| Euclidean algorithm for polynomials | Euclidean domains via predicate surface "applicableOver" ⓘ |
| Euclidean algorithm for polynomials | principal ideal domains via embeddings via predicate surface "applicableOver" ⓘ |
| Bézout’s theorem | algebraically closed field ⓘ |