#$negationPreds mutually-negating predicate (taxonomic slot) (intangible object relating predicate) (symmetric binary predicate)

A #$MetaPredicate for stating that two predicates are logical contraries of one another. (#$negationPreds PRED1 PRED2) means that if PRED1 holds among a given sequence of things, then PRED2 does _not_ hold among that sequence (and vice versa). In other words, (#$negationPreds PRED1 PRED2) is equivalent to (#$not (#$and (PRED1 . ARGS) (PRED2 . ARGS))). For example, (#$negationPreds #$owns #$rents) holds, as one cannot both own and rent a given thing at the same time. Note that PRED1 and PRED2 are constrained (see e.g. #$interArgIsa) either to both having the same fixed-arity (see #$FixedArityRelation) or to both having variable-arity (see #$VariableArityRelations). See also #$genlPreds and #$negationInverse.

guid: bd610a5c-9c29-11b1-9dad-c379636f7270

direct instance of: #$TaxonomicSlotForPredicates #$OpenCycDefinitionalPredicate #$DefaultMonotonicPredicate #$SymmetricBinaryPredicate #$RuleMacroPredicate #$IrreflexiveBinaryPredicate

#$negationInverse negation inverse

A #$MetaPredicate for stating that each of two binary predicates is a logical contrary of the other’s inverse. (#$negationInverse BINPRED1 BINPRED2) means that if BINPRED1 holds between a pair , then BINPRED2 does _not_ hold between the inverse pair (and vice versa). In other words, (#$negationInverse BINPRED1 BINPRED2) is equivalent to (#$not (#$and (BINPRED1 ARG1 ARG2) (BINPRED2 ARG2 ARG1))). Note that any #$AsymmetricBinaryPredicate is related to itself by #$negationInverse. For example, (#$negationInverse #$subordinates #$subordinates) holds, since if one person is a subordinate of another, the latter person cannot at the same time also be a subordinate of the former. See also #$negationPreds and #$genlInverse.

guid: bd5c44e1-9c29-11b1-9dad-c379636f7270

direct instance of: #$TaxonomicSlotForPredicates #$OpenCycDefinitionalPredicate #$SymmetricBinaryPredicate #$RuleMacroPredicate