Math 2.0

concept

Ordered pair

Summary

An ordered pair is a pair of objects in which the order matters. Two ordered pairs are equal exactly when their first entries are equal and their second entries are equal.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Ordered_pair, lead section

What links here

Definitions