OurBigBook About$ Donate
 Sign in Sign up

Order automorphism (Aut(I,<))

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Set Total order
2026-10-05  0 By others on same topic  0 Discussions Create my own version
An order automorphism of a total order (I,<) is a bijection π:I→I such that i<j if and only if π(i)<π(j). Composition and inverses are again order automorphisms. Transporting the indices of an order-indiscernible sequence by such a map preserves every first-order formula on increasing finite tuples.

 Ancestors (7)

  1. Total order
  2. Set
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Ehrenfeucht-Mostowski theorem
  • Order automorphism
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 135 / 4 / Solution
  • Ultraproduct proof of the Ehrenfeucht-Mostowski theorem

 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