SUMO View all facts Glossary Help |
| Entity > Abstract > Class > Relation > Function > BinaryFunction > KappaFn |
| KappaFn | ||||
| subject | fact | |||
| KappaFn | documentation A class-forming operator that takes two arguments: a variable and a formula containing at least one unbound occurrence of the variable. The result of applying KappaFn to a variable and a formula is the Class of things that satisfy the formula. For example, we can denote the Class of prime numbers that are less than 100 with the following expression: (KappaFn ?NUMBER (and (instance ?NUMBER PrimeNumber) (lessThan ?NUMBER 100))). Note that the use of this function is discouraged, since there is currently no axiomatic support for it | ![]() |
| has domain1 SymbolicString | ![]() | |
| has domain2 Formula | ![]() | |
| has range Class | ![]() | |
| is an instance of BinaryFunction | ![]() | |
| BinaryFunction | has axiom (<=> | ![]() |
has axiom (=> | ![]() | |
has axiom (=> | ![]() | |
has axiom (=> | ![]() | |
has axiom (=> | ![]() | |
| is first domain of distributes | ![]() | |
| is first domain of identityElement | ![]() | |
| is second domain of distributes | ![]() | |
| Class | is third domain of domain | ![]() |
| is third domain of domainSubclass | ![]() | |
| Abstract | is disjoint from Physical | ![]() |
Next BinaryFunction: LogFn Up: BinaryFunction Previous BinaryFunction: IntersectionFn