On injective enumerability of recursively enumerable classes of cofinite sets

DOI10.1007/BF01375520MaRDI QIDQ1893231zbMATH OpenWikidataFDO

Authors Stephan Wehner

Publication date 3 July 1995

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

Full work available at URL https://doi.org/10.1007/BF01375520

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On recursive enumerability with finite repetitions
• The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑₅‐Complete
• A class of recursively enumerable sets
• scientific article; zbMATH DE number 4114607

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

Cited in

(2)

• The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑₅‐Complete
• On recursive enumerability with finite repetitions

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

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