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