Linear orderings under one-one reducibility
From MaRDI portal
Publication:5547582
DOI10.2307/2270621zbMath0163.25204MaRDI QIDQ5547582
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
Related Items
Two Theorems on Hyperhypersimple Sets, Relationships Between Reducibilities, Reductions among polynomial isomorphism types, Collapsing degrees, Independence results in computer science?, tt- and m-degrees, Partially ordered sets of 1-degrees, contained in recursively enumerable \(m\)-degrees, Combinatorial systems. I: Cylindrical problems, Strong reducibilities, Diem-Grade Logischer Entscheidungsprobleme, Almost Recursively Enumerable Sets
Cites Work