A remark on the length problem (Q1112021): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3333022 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Retraceable Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Theorem on Hypersimple Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively enumerable generic sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Splitting properties and jump classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively Enumerable Sets and Retracing Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank |
Latest revision as of 11:02, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A remark on the length problem |
scientific article |
Statements
A remark on the length problem (English)
0 references
1988
0 references
See the review of \textit{M. Kummer}'s paper: ``The length problem for co- r.e. sets'' [Z. Math. Logik Grundlagen Math. 34, No.3, 277-282 (1988)] in Zbl 0639.03045. The length-problem was formulated by \textit{V. Sperschneider} in Lect. Notes Comput. Sci. 171, 88-102 (1984; Zbl 0544.03018).
0 references
promptly hypersimple set
0 references
coretraceable set
0 references