On injective enumerability of recursively enumerable classes of cofinite sets

DOI10.1007/BF01375520zbMath0822.03023WikidataQ114233966 ScholiaQ114233966MaRDI QIDQ1893231

Stephan Wehner

Publication date: 3 July 1995

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

zbMATH Keywords

embeddabilityinjective enumerabilityLachlan's condition (F)recursively enumerable classes of cofinite sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

On recursive enumerability with finite repetitions

Cites Work

• A STRUCTURAL CRITERION FOR RECURSIVE ENUMERATION WITHOUT REPETITION
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• On Recursive Enumeration Without Repetition
• On Recursive Enumeration Without Repetition: A Correction

This page was built for publication: On injective enumerability of recursively enumerable classes of cofinite sets