Computability Learning Seminar

Michael Deveau, Department of Pure Mathematics, University of Waterloo

“Embedding Lattices in the Computably Enumerable Degrees (Part 4)”

We finish the proof that the non-distributive lattice M5 can be embedded into the c.e. degrees, picking up with where we left off last week: the verification that the minimal pair condition holds pairwise for A1, A2andA3.

MC 5403