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
221
Edward M. McCreight · SIAM Journal on Computing · 1985 · 499 citations
Tarski Grothendieck Set Theory
Andrzej Trybulec · 1990 · 482 citations
1–5 of 221
420
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 420
235

Tel Aviv University
Tel Aviv, Israel
5 h-index
5 publications
259 citations
University of California, Berkeley
Berkeley, United States
5 h-index
5 publications
491 citations
University of Arizona
Tucson, United States
5 h-index
9 publications
646 citations
Stanford University
Stanford, United States
4 h-index
6 publications
844 citations
University of Wisconsin–Madison
Madison, United States
4 h-index
4 publications
228 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
328 citations

Sichuan University
Chengdu, China
4 h-index
6 publications
270 citations
University of California San Diego
San Diego, United States
3 h-index
8 publications
413 citations
1–8 of 235
11 publications · 242 citations
11
h-index
7 publications · 198 citations
7
h-index
TRAN · 5 publications · 101 citations
5
h-index
4 publications · 308 citations
4
h-index
3 publications · 96 citations
3
h-index
1–5