The strong homogeneity conjecture

DOI10.2307/2270693zbMath0251.02042OpenAlexW2063255304WikidataQ123159047 ScholiaQ123159047MaRDI QIDQ5663847

Lawrence Feiner

Publication date: 1971

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

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

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (7)

Cototal enumeration degrees and their applications to effective mathematics ⋮ The jump is definable in the structure of the degrees of unsolvability ⋮ Recursive Linear Orders with Incomplete Successivities ⋮ Degrees of Nonrecursive Presentability ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ Computable presentability of countable linear orders ⋮ Initial segments of the degrees of size \(\aleph _ 1\)

Cites Work

• Unnamed Item

This page was built for publication: The strong homogeneity conjecture