Linear orderings under one-one reducibility

DOI10.2307/2270621zbMath0163.25204OpenAlexW2083904032MaRDI QIDQ5547582

P. R. Young

Publication date: 1966

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270621

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

Reductions among polynomial isomorphism types, Collapsing degrees, Two Theorems on Hyperhypersimple Sets, Relationships Between Reducibilities, Independence results in computer science?, Irreducible, singular, and contiguous degrees, Diem-Grade Logischer Entscheidungsprobleme, tt- and m-degrees, Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees, Computable presentability of countable linear orders, On \(1\)-degrees inside \(m\)-degrees, Almost Recursively Enumerable Sets, Combinatorial systems. I: Cylindrical problems, Strong reducibilities

Cites Work

• Recursive digraphs, splinters and cylinders
• Approximation of functions on the integers
• A note on pseudo-creative sets and cylinders
• Recursively enumerable sets of positive integers and their decision problems