Linear orderings under one-one reducibility

DOI10.2307/2270621zbMATH Open0163.25204OpenAlexW2083904032MaRDI QIDQ5547582FDOQ5547582

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

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

Cited In (14)

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

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)