Array nonrecursiveness and relative recursive enumerability

DOI10.2178/jsl/1327068689zbMath1269.03044OpenAlexW1964901137MaRDI QIDQ5388716

Mingzhong Cai

Publication date: 19 April 2012

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1327068689

zbMATH Keywords

minimal coverr.e. degreearray nonrecursive degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (2)

Domination, forcing, array nonrecursiveness and relative recursive enumerability ⋮ Defining totality in the enumeration degrees

Cites Work

• Bounding non-GL₂ and R.E.A.
• Classifying model-theoretic properties
• Double jumps of minimal degrees
• Bounding prime models
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Π10 classes, strong minimal covers and hyperimmune-free degrees
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Array nonrecursiveness and relative recursive enumerability