Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

William C. Calhoun, Manuel Lerman. Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. Journal of Symbolic Logic, 66(4):1791-1802, 2001.

The following publications are possibly variants of this publication:

A Finite Lattice without Critical Triple that cannot be Embedded into the Enumerable Turing DegreesSteffen Lempp, Manuel Lerman. APAL, 87(2):167-185, 1997.

A Necessary and Sufficient Condition for Embedding Principally Decomposable Finite Lattices into the Computably Enumerable DegreesManuel Lerman. APAL, 101(2-3):275-297, 2000.

A Necessary and Sufficient Condition for Embedding Ranked Finite Partial Lattices into the Computably Enumerable DegreesManuel Lerman. APAL, 94(1-3):143-180, 1998.

Lattice Embeddings into the Recursively Enumerable DegreesKlaus Ambos-Spies, Manuel Lerman. JSYML, 51(2):257-272, 1986.

Lattice Embeddings into the Recursively Enumerable Degrees IIKlaus Ambos-Spies, Manuel Lerman. JSYML, 54(3):735-760, 1989.

runs on WebDSL