Array nonrecursiveness and relative recursive enumerability
From MaRDI portal
Publication:5388716
DOI10.2178/jsl/1327068689zbMath1269.03044OpenAlexW1964901137MaRDI QIDQ5388716
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
Related Items
Domination, forcing, array nonrecursiveness and relative recursive enumerability, Defining totality in the enumeration degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding non-GL2 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