Computability Learning Seminar

Jonny Stephenson, Department of Pure Mathematics, University of Waterloo

"The c.e. embeddability condition"

We will discuss the c.e. embeddability condition, which is a condition introduced by Richter, and which provides an exact characterization of those structures which do not code any non-c.e. sets. Such structures cannot have nontrivial Turing or enumeration degrees. If time permits, we will demonstrate that linear orderings have the c.e. embeddability condition.

MC 5403