On recursive enumerability with finite repetitions

DOI10.2307/2586612MaRDI QIDQ4934022zbMATH OpenOpenAlexFDO

Authors Stephan Wehner

Publication date 17 January 2000

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2586612

zbMATH Keywords

recursive enumerability with finite repetitionsrecursively enumerable classesrecursively enumerable sets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3857079
• scientific article; zbMATH DE number 3997771
• scientific article; zbMATH DE number 4148069
• Some Theorems on Classes of Recursively Enumerable Sets
• Effectively infinite classes of enumerations

Cites work

• An easy priority-free proof of a theorem of Friedberg
• On injective enumerability of recursively enumerable classes of cofinite sets
• On Recursive Enumeration Without Repetition
• Recursively enumerable classes and their application to recursive sequences of formal theories
• The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑₅‐Complete

Cited in

(11)

• Some effectively infinite classes of enumerations
• On injective enumerability of recursively enumerable classes of cofinite sets
• Effectively infinite classes of enumerations
• On completely recursively enumerable classes and their key arrays
• Uniform regular enumerations
• scientific article; zbMATH DE number 4148069 (Why is no real title available?)
• A class of enumerable sets
• scientific article; zbMATH DE number 3997771 (Why is no real title available?)
• An algorithm for enumerating all infinite repetitions in a D0L-system
• Array nonrecursiveness and relative recursive enumerability
• An easy priority-free proof of a theorem of Friedberg

This page was built for publication: On recursive enumerability with finite repetitions

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