Definition:Infix Notation/Binary Relation
Jump to navigation
Jump to search
Definition
Let $\RR \subseteq S \times T$ be a binary relation.
When $\tuple {s, t} \in \RR$, we can write either:
- $\map \RR {s, t}$
or
- $s \mathrel \RR t$
The notation $s \mathrel \RR t$ is known as infix notation.
Sources
This page may be the result of a refactoring operation. As such, the following source works, along with any process flow, will need to be reviewed. When this has been completed, the citation of that source work (if it is appropriate that it stay on this page) is to be placed above this message, into the usual chronological ordering. In particular: Put this in its place If you have access to any of these works, then you are invited to review this list, and make any necessary corrections. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{SourceReview}} from the code. |
- 1996: H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability: $\S 2.2$