quantifiesOver
P54447
predicate
Indicates that one entity expresses a quantity, measurement, or numerical specification that applies to or ranges over another entity.
All labels observed (3)
| Label | Occurrences |
|---|---|
| quantifiesOver canonical | 18 |
| coreQuantifiers | 1 |
| involvesQuantifiers | 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: quantifiesOver
Generated description
Indicates that one entity expresses a quantity, measurement, or numerical specification that applies to or ranges over another entity.
Sample triples (20)
| Subject | Object |
|---|---|
| axiom schema of separation | formulas of the language of set theory ⓘ |
| epsilon–delta definition of limit | for every ε > 0 there exists δ > 0 via predicate surface "coreQuantifiers" ⓘ |
| Hasse principle | solutions in Q ⓘ |
| Hasse principle | solutions in R ⓘ |
| Hasse principle | solutions in Q_p for all primes p ⓘ |
| Hilbert’s tenth problem | integer solutions ⓘ |
| Peano arithmetic | individual natural numbers ⓘ |
|
CTL*
linked to:
branching-time temporal logic CTL*
|
computation paths in a transition system ⓘ |
| Yao’s next-bit test | all polynomial-time prediction algorithms ⓘ |
| Yao’s next-bit test | all positions in the output sequence ⓘ |
| Erdős discrepancy problem | for all C > 0 there exist n,d ∈ ℕ via predicate surface "involvesQuantifiers" ⓘ |
| Erdős discrepancy problem | all infinite ±1 sequences ⓘ |
| Erdős discrepancy problem | all positive integers C ⓘ |
| Erdős discrepancy problem | positive integers n ⓘ |
| Erdős discrepancy problem | positive integers d ⓘ |
| Legendre's three-square theorem | nonnegative integers a and b ⓘ |
| Linnik’s theorem on the least prime in an arithmetic progression | all integers q ≥ 1 ⓘ |
| Linnik’s theorem on the least prime in an arithmetic progression | all integers a with gcd(a,q)=1 ⓘ |
| System F | types ⓘ |
| Skolem arithmetic | individual variables for natural numbers ⓘ |