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