Search results
Results from the WOW.Com Content Network
In linguistics, converses or relational antonyms are pairs of words that refer to a relationship from opposite points of view, such as parent/child or borrow/lend. [ 1 ] [ 2 ] The relationship between such words is called a converse relation . [ 2 ]
Complementary antonyms are word pairs whose meanings are opposite but whose meanings do not lie on a continuous spectrum (push, pull). Relational antonyms are word pairs where opposite makes sense only in the context of the relationship between the two meanings (teacher, pupil). These more restricted meanings may not apply in all scholarly ...
Relational antonyms are word pairs where opposite makes sense only in the context of the relationship between the two meanings (teacher, pupil). These more restricted meanings may not apply in all scholarly contexts, with Lyons (1968, 1977) defining antonym to mean gradable antonyms, and Crystal (2003) warning that antonymy and antonym should ...
Your example: own and belong are relational opposites i.e. "A owns B" is the same as "B belongs to A." Win and lose i.e. if someone wins, someone must lose. The inference goes that the two verbs used allow the conversion of the position of the two operands without changing the meaning of the original sentence.
In the monoid of binary endorelations on a set (with the binary operation on relations being the composition of relations), the converse relation does not satisfy the definition of an inverse from group theory, that is, if is an arbitrary relation on , then does not equal the identity relation on in general.
For example, with the predicate P as "x is mortal" and the domain of x as the collection of all humans, () means "a person x in all humans is mortal" or "all humans are mortal". The negation of it is ¬ ∀ x P ( x ) ≡ ∃ x ¬ P ( x ) {\displaystyle \neg \forall xP(x)\equiv \exists x\neg P(x)} , meaning "there exists a person x in all humans ...
Another possibility is that sequences of certain operators are interpreted in some other way, which cannot be expressed as associativity. This generally means that syntactically, there is a special rule for sequences of these operations, and semantically the behavior is different. A good example is in Python, which has several such constructs. [5]
Relational operators are also used in technical literature instead of words. Relational operators are usually written in infix notation, if supported by the programming language, which means that they appear between their operands (the two expressions being related). For example, an expression in Python will print the message if the x is less ...