Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834): Difference between revisions

@@ Property / author @@
-Manuel Lerman
@@ Property / author: Manuel Lerman / rank @@
-Normal rank
@@ Property / author @@
+Manuel Lerman
@@ Property / author: Manuel Lerman / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2694975
@@ Property / full work available at URL: https://doi.org/10.2307/2694975 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2010643345
@@ Property / OpenAlex ID: W2010643345 / rank @@
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
+Normal rank
@@ Property / cites work @@
+A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
+Normal rank
@@ Property / cites work @@
+Not every finite lattice is embeddable in the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+Lattice nonembeddings and initial segments of the recursively enumerable degrees
+Normal rank
@@ Property / cites work @@
+A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4328834