Thursday, August 6, 2015

Thursday, August 6, 2015 — 2:00 PM EDT

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices into the Computably Enumerable Degrees"

The question of which finite lattices can be embedded into the c.e.
degrees first arose with the construction of a minimal pair by Yates,
and independently by Lachlan, showing the 4 element Boolean algebra
can be embedded. This result was rapidly generalised to show any
finite distributive lattice can also be embedded. For non-distributive
lattices, the situation is more complicated.

S M T W T F S
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2020 (48)
    1. February (26)
    2. January (22)
  2. 2019 (199)
    1. December (7)
    2. November (26)
    3. October (19)
    4. September (13)
    5. August (7)
    6. July (12)
    7. June (18)
    8. May (22)
    9. April (11)
    10. March (25)
    11. February (17)
    12. January (22)
  3. 2018 (219)
  4. 2017 (281)
  5. 2016 (335)
  6. 2015 (209)
    1. December (7)
    2. November (39)
    3. October (38)
    4. September (15)
    5. August (10)
    6. July (18)
    7. June (24)
    8. May (12)
    9. April (2)
    10. March (27)
    11. January (17)
  7. 2014 (235)
  8. 2013 (251)
  9. 2012 (135)