Three Theorems on n-REA Degrees: Proof-Readers and Verifiers

DOI10.1007/978-3-642-21875-0_2zbMath1345.03082OpenAlexW2197371966MaRDI QIDQ3091436

Mingzhong Cai

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_2

Mathematics Subject Classification ID

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

Cites Work

• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Computability and Randomness
• Π10 classes, strong minimal covers and hyperimmune-free degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three Theorems on n-REA Degrees: Proof-Readers and Verifiers