scientific article; zbMATH DE number 1394931

MaRDI QIDQ4934976zbMATH OpenFDO

Authors Asae Mochizuki

Publication date 9 March 2000

zbMATH Keywords

Boolean algebralattice embeddingpolynomial computable sets of integerspolynomial time reducibilityquotient latticeupper semilattice of p-s-degrees of recursive functions

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On the embedding of distributive lattices into recursive polynomial degrees
• Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
• scientific article; zbMATH DE number 4160711
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• scientific article; zbMATH DE number 749917

Cited in

(5)

• Lattice embeddings into the recursively enumerable degrees
• On the embedding of distributive lattices into recursive polynomial degrees
• Lattice embeddings and array noncomputable degrees
• scientific article; zbMATH DE number 749917 (Why is no real title available?)
• Embedding \(\mathrm{FD}(\omega)\) into \({\mathcal{P}_s}\) densely

This page was built for publication:

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