Array nonrecursiveness and relative recursive enumerability

DOI10.2178/JSL/1327068689MaRDI QIDQ5388716zbMATH OpenOpenAlexFDO

Authors Mingzhong Cai

Publication date 19 April 2012

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

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

zbMATH Keywords

array nonrecursive degreeminimal coverr.e. degree

Mathematics Subject Classification ID

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

Recommendations

• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Iterated relative recursive enumerability
• scientific article; zbMATH DE number 841084
• On completely recursively enumerable classes and their key arrays
• On recursively enumerable structures
• On recursive enumerability with finite repetitions
• Recursive versus recursively enumerable binary relations
• RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS
• Complete, Recursively Enumerable Relations in Arithmetic
• Randomness and recursive enumerability

Cites work

• ∏ 0 1 Classes and Degrees of Theories
• Bounding non-GL₂ and R.E.A.
• Bounding prime models
• Classifying model-theoretic properties
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Double jumps of minimal degrees
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 3914306 (Why is no real title available?)
• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• scientific article; zbMATH DE number 1421074 (Why is no real title available?)
• Π10 classes, strong minimal covers and hyperimmune-free degrees

Cited in

(10)

• Array nonrecursive degrees and lattice embeddings of the diamond
• Multiple permitting and array noncomputability
• A c.e. weak truth table degree which is array noncomputable and r-maximal
• Three theorems on n-REA degrees: proof-readers and verifiers
• scientific article; zbMATH DE number 4172959 (Why is no real title available?)
• scientific article; zbMATH DE number 4148069 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• scientific article; zbMATH DE number 5199066 (Why is no real title available?)
• Domination, forcing, array nonrecursiveness and relative recursive enumerability
• Defining totality in the enumeration degrees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388716)