Retraceable Sets

DOI10.4153/CJM-1958-035-XzbMATH Open0082.01505OpenAlexW4233266865MaRDI QIDQ3250596FDOQ3250596

Authors J. C. E. Dekker, John Myhill

Publication date 1958

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1958-035-x

zbMATH Keywords

philosophy and foundations of mathematics

Cited in

(45)

• Nonrecursive combinatorial functions
• Regressive sets of order \(n\)
• A Fine Structure in the Theory of Isols
• Higher-Order Indecomposable Isols
• Degrees of sets having no subsets of higher m- and t t-degree
• No Recursively Enumerable Set is the Union of Finitely Many Immune Retraceable Sets
• Relationships between computability-theoretic properties of problems
• scientific article; zbMATH DE number 3427337 (Why is no real title available?)
• An answer to a question by P. R. Young
• Recursive digraphs, splinters and cylinders
• tt- and m-degrees
• The divisibility of isols by powers of primes
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Closure and nonclosure properties of the classes of compressible and rankable sets
• Countable thin \(\Pi^0_1\) classes
• The Halting Problem Relativized to Complements
• Computing sets from all infinite subsets
• Independence results in computer science?
• Bibliography of John Myhill
• On the Cantor-Bendixon rank of recursively enumerable sets
• Splinters and Turing degrees
• Notions of weak genericity
• Relationships Between Reducibilities
• Minimal-program complexity of pseudo-recursive and pseudo-random sequences
• The theory of the \(\alpha \) degrees is undecidable
• Hereditary sets and tabular reducibility
• The minimum of two regressive isols
• On the Degrees of Index Sets
• Recursively enumerable sets and degrees
• Sets without subsets of higher many-one degree
• Deficiency Sets and Bounded Information Reducibilities
• Solution of a problem of R. Friedberg
• Low sets without subsets of higher many-one degree
• The degrees of hyperhyperimmune sets
• Recursion-theoretic ranking and compression
• A remark on the length problem
• Retraceable Sets and Recursive Permutations
• Semirecursive Sets and Positive Reducibility
• Almost Recursively Enumerable Sets
• Hereditarily retraceable isols
• Ramsey's theorem for computably enumerable colorings
• On the structures inside truth-table degrees
• Uniformly introreducible sets
• Regressive upper bounds
• Degrees of randomized computability

This page was built for publication: Retraceable Sets

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