Embeddings into the computably enumerable degrees
Author(s) -
Manuel Lerman
Publication year - 2000
Publication title -
contemporary mathematics - american mathematical society
Language(s) - English
Resource type - Reports
SCImago Journal Rank - 0.106
H-Index - 12
eISSN - 1098-3627
pISSN - 0271-4132
DOI - 10.1090/conm/257/04035
Subject(s) - mathematics , discrete mathematics , arithmetic
We discuss the status of the problem of characterizing the finite (weak) lattices which can be embedded into the computably enumerable degrees. In particular, we summarize the current status of knowledge about the problem, provide an overview of how to prove these results, discuss directions which have been pursued to try to solve the problem, and present some related
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom