Embedding relations in the lattice of recursively enumerable sets

DOI10.1007/BF02280811MaRDI QIDQ4074892zbMATH OpenOpenAlexFDO

Authors Donald A. Alton

Publication date 1975

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137901

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Cites work

• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Iterated Quotients of the Lattice of Recursively Enumerable Sets
• On the Lattice of Recursively Enumerable Sets
• Solvable cases of the decision problem
• The elementary theory of recursively enumerable sets
• Two Theorems on Hyperhypersimple Sets

This page was built for publication: Embedding relations in the lattice of recursively enumerable sets

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