Linear orderings under one-one reducibility

DOI10.2307/2270621MaRDI QIDQ5547582zbMATH OpenOpenAlexFDO

Authors 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

Cites work

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

Cited in

(14)

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

This page was built for publication: Linear orderings under one-one reducibility

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