Almost weakly 2-generic sets

DOI10.2307/2275914MaRDI QIDQ4314677zbMATH OpenOpenAlexFDO

Authors S. Fenner

Publication date 21 January 1996

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

Full work available at URL https://doi.org/10.2307/2275914

zbMATH Keywords

almost weakly 2-generic sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS
• A Weakly 2-Random Set That Is Not Generalized Low
• Notions of weak genericity
• On relatively weakly almost Lindelöf subsets
• Weakly generalized closed sets in minimal structure
• scientific article; zbMATH DE number 4181694
• Weakly semirecursive sets
• scientific article; zbMATH DE number 6304347
• Weak separation axioms via almost-ID-sets

Cites work

• A 1-generic degree which bounds a minimal degree
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)

Cited in

(2)

• WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE

This page was built for publication: Almost weakly 2-generic sets

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