Computably enumerable sets and quasi-reducibility
From MaRDI portal
Publication:1295419
DOI10.1016/S0168-0072(98)00013-XzbMath0930.03049OpenAlexW1963706220MaRDI QIDQ1295419
Publication date: 16 August 1999
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00013-x
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (11)
Strong enumeration reducibilities ⋮ Hyperhypersimple sets and Q1 -reducibility ⋮ Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees ⋮ \(sQ_1\)-degrees of computably enumerable sets ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ Irreducible, singular, and contiguous degrees ⋮ Interpreting true arithmetic in the -enumeration degrees ⋮ Structural properties of \(Q\)-degrees of n-c.e. sets ⋮ Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees ⋮ \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets ⋮ More undecidable lattices of Steinitz exchange systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural interactions of the recursively enumerable T- and W-degrees
- Word problems II. The Oxford book
- Definability in algebraically closed groups
- Undecidable theories
- Quasicreative Sets
- The Degrees of R.E. Sets Without the Universal Splitting Property
- Interpretability and Definability in the Recursively Enumerable Degrees
- Ein Rekursiv Aufzählbarer btt‐Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört
- Omitting quantifier-free types in generic structures
- Lower Bounds for Pairs of Recursively Enumerable Degrees
- Semirecursive Sets and Positive Reducibility
This page was built for publication: Computably enumerable sets and quasi-reducibility
