Ordered Pairs

An Ordered Pairs is a fundamental construct in Naive Set Theory and the foundation of the Cartesian Product, defined as a mathematical object consisting of two elements with a fixed order, such that the ordered pair (a, b) is identical to (c, d) if and only if a = c and b = d, distinguishing it from unordered pairs by the significance of element position.

221

Publications

13.1K

Citations

420

Authors

235

Institutions

Publications per year

2017–2026

31

Variants

2-TuplesTuples Of Length Two

Authors

420

  1. ZX
    Zeshui Xu

    Sichuan University, China

    4 publications · 175 citations

    4

    h-index

  2. PT
    Paul Terwilliger

    University of Wisconsin–Madison, United States

    3 publications · 163 citations

    3

    h-index

  3. RM
    Raphael M. Robinson

    University of California, Berkeley, United States

    3 publications · 85 citations

    3

    h-index

  4. AT
    Andrzej Trybulec

    University of Białystok, Poland

    3 publications · 846 citations

    3

    h-index

  5. BZ
    Boyan Zlatanov

    Plovdiv University, Bulgaria

    3 publications · 54 citations

    3

    h-index

1–5 of 420

Venues

  1. Journal of Symbolic Logic

    11 publications · 242 citations

    11

    h-index

  2. Pacific Journal of Mathematics

    7 publications · 198 citations

    7

    h-index

  3. Transactions of the American Mathematical Society

    TRAN · 5 publications · 101 citations

    5

    h-index

  4. International Journal of Intelligent Systems

    4 publications · 308 citations

    4

    h-index

  5. 3

    h-index

1–5