OurBigBook About$ Donate
 Sign in Sign up

Tagged encoding of a finite tuple ((ai​)i=1n​⟼{⟨ti​,ai​⟩:1≤i≤n})

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Cartesian product Finite tuple
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Using distinct fixed tags t1​,…,tn​, encode a tuple (a1​,…,an​) by the set {⟨ti​,ai​⟩:1≤i≤n}. Injectivity of the ordered-pair construction makes the unique member with first coordinate ti​ recover ai​. Thus a set can retain the order of a finite tuple when its entries are tagged, even if some coordinates coincide.

 Ancestors (7)

  1. Finite tuple
  2. Cartesian product
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the logic and set theory course of the University of Oxford / 2008 / B / 6 / 3 / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook