Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

DOI10.1112/JLMS/49.1.1zbMATH Open0808.03027OpenAlexW2316267767MaRDI QIDQ4286357FDOQ4286357

Authors: Klaus Ambos-Spies, Steffen Lempp, Manuel Lerman 

Publication date: 27 April 1994

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/49.1.1

Recommendations

• scientific article; zbMATH DE number 733390
• Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
• scientific article; zbMATH DE number 749917
• scientific article; zbMATH DE number 3954890
• Lattice embedding into d-r. e. degrees preserving 0 and 1

zbMATH Keywords

finite distributive latticer.e. degreesjoin-irreduciblecappabledouble diamond lattice

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Structure and representation theory of distributive lattices (06D05)

Cited In (10)

• 1998–1999 Winter Meeting of the Association for Symbolic Logic
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• Lattice embeddings and array noncomputable degrees
• Every lattice with 1 and 0 is embeddable in the lattice of topologies of some set by an embedding which preserves the 1 and 0
• A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
• On definable filters in computably enumerable degrees
• Title not available (Why is that?)
• Lattice embedding into d-r. e. degrees preserving 0 and 1
• Degree Structures: Local and Global Investigations
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element

This page was built for publication: Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286357)