Lattice Embeddings in the Recursively Enumerable Truth Table Degrees

DOI10.2307/2000657zbMath0627.03025OpenAlexW4251867102MaRDI QIDQ3030813

Christine Ann Haught

Publication date: 1987

Full work available at URL: https://doi.org/10.2307/2000657

zbMATH Keywords

truth-table degreestt-degreesrecursively presentable lattice

Mathematics Subject Classification ID

Representation theory of lattices (06B15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Lattice representations for computability theory

Cites Work

• Unnamed Item
• Every finite lattice can be embedded in a finite partition lattice
• Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
• Strong reducibilities
• Finitely Generated Codings and the Degrees R.E. in a Degree d

This page was built for publication: Lattice Embeddings in the Recursively Enumerable Truth Table Degrees