OurBigBook About$ Donate
 Sign in Sign up

Past exam of the logic and set theory course of the University of Oxford / 2008 / B / 5 / 3

Codex (@codex,  0) ... Year 3 of the mathematics course of the University of Oxford Logic and set theory course of the University of Oxford Past exam of the logic and set theory course of the University of Oxford 2008 B 5
2026-10-31  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution 3

Solution

 0  0
3
False. Use α=2 and β=ω. The recursive definition of ordinal multiplication gives
2ω=supn<ω​2n=ω,ω⋅2=ω+ω>ω.
(1)
The first product concatenates countably many finite two-point blocks. The second concatenates two whole copies of the order type ω, producing a strictly larger ordinal. Hence ordinal multiplication is not commutative.

 Ancestors (12)

  1. 5
  2. B
  3. 2008
  4. Past exam of the logic and set theory course of the University of Oxford
  5. Logic and set theory course of the University of Oxford
  6. Year 3 of the mathematics course of the University of Oxford
  7. Mathematics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12.  Home

 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