On recursive enumerability with finite repetitions

DOI10.2307/2586612zbMath0945.03064OpenAlexW1973052363MaRDI QIDQ4934022

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

recursively enumerable setsrecursively enumerable classesrecursive enumerability with finite repetitions

Mathematics Subject Classification ID

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

Cites Work

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