A remark on the length problem

DOI10.1016/0304-3975(88)90081-3MaRDI QIDQ1112021zbMATH OpenOpenAlexFDO

Authors Jeanleah Mohrherr

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90081-3

zbMATH Keywords

coretraceable setpromptly hypersimple set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Review text

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).

Recommendations

• scientific article; zbMATH DE number 3865259
• On a conjecture about relative lengths
• A Note on the Length of Proofs
• scientific article; zbMATH DE number 6700476
• Remarques sur le spectre des longueurs d'une surface et comptages
• On the Fitting length conjecture
• A remark on a problem of A. Rényi
• Remark on kneser problem
• scientific article; zbMATH DE number 3844334

Cites work

• A Theorem on Hypersimple Sets
• scientific article; zbMATH DE number 3865259 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Recursively enumerable generic sets
• Recursively Enumerable Sets and Retracing Functions
• Retraceable Sets
• Splitting properties and jump classes

Cited in

(3)

• scientific article; zbMATH DE number 3865259 (Why is no real title available?)
• scientific article; zbMATH DE number 4033720 (Why is no real title available?)
• The Length Problem for Co-R.E. Sets

This page was built for publication: A remark on the length problem

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