Index sets related to prompt simplicity

DOI10.1016/0168-0072(89)90018-3zbMath0665.03032OpenAlexW2003696442MaRDI QIDQ1115863

Steven Schwarz

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90018-3

zbMATH Keywords

index setspromptly simple sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

Families of permutations and ideals of Turing degrees ⋮ Upper bounds on ideals in the computably enumerable Turing degrees ⋮ Incomparable prime ideals of recursively enumerable degrees

Cites Work

• Unnamed Item
• Computing degrees of unsolvability
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Computational complexity of recursively enumerable sets
• On the Degrees of Index Sets
• On definable sets of positive integers
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Recursive Predicates and Quantifiers

This page was built for publication: Index sets related to prompt simplicity