Name
Abstract | ||
|---|---|---|
We prove that every countable distributive lattice is embeddable in the Σ02 enumeration degrees via a 0—1 preserving monomorphism. Moreover, we prove that every countable distributive lattice is embeddable below arbitrary Δ02 degree via a 0 preserving monomorphism. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1093/logcom/exq042 | J. Log. Comput. |
Keywords | Field | DocType |
countable distributive lattice,enumeration degree | Discrete mathematics,Distributive property,Combinatorics,Congruence lattice problem,Distributive lattice,Embedding,Countable set,Lattice (order),Enumeration,Monomorphism,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 4 | 0955-792X |
Citations | PageRank | References |
2 | 0.50 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hristo Ganchev | 1 | 5 | 4.04 |
| Mariya Ivanova Soskova | 2 | 21 | 10.54 |