A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
type: Item
instance of: scholarly article
title: A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
zbMATH Open document ID: 0924.03075
DOI: 10.1016/S0168-0072(97)00071-7
published in: Annals of Pure and Applied Logic
publication date: 1999-11-08T00:00:00Z
review text: The problem of characterizing partial finite lattices embeddable into the computably enumerable degrees is studied. The author introduces a notion of ranked partial lattice and decribes a necessary and sufficient condition for embeddings of such lattices. This gives a hope to obtain a complete decision of the problem.
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 06B99
zbMATH DE Number: 1308080
zbMATH Keywords: computably enumerable set
zbMATH Keywords: degrees
zbMATH Keywords: embeddings
zbMATH Keywords: partial lattice
author: Manuel Lerman
reviewed by: Sh. T. Ishmukhametov
MaRDI profile type: Publication
cites work: Lattice embeddings into the recursively enumerable degrees
cites work: Lattice embeddings into the recursively enumerable degrees. II
cites work: Lattice nonembeddings and initial segments of the recursively enumerable degrees
cites work: Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees
cites work: Not every finite lattice is embeddable in the recursively enumerable degrees
cites work: A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
cites work: Q4044555
cites work: Q4863245
cites work: The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
cites work: On Suborderings of Degrees of Recursive Unsolvability
cites work: Algebraic aspects of the computably enumerable degrees.
cites work: Recursively enumerable sets and degrees
cites work: A minimal pair of recursively enumerable degrees
description: scientific article; zbMATH DE number 1308080