scientific article; zbMATH DE number 833149

MaRDI QIDQ4859902zbMATH OpenFDO

Authors

Publication date 11 January 1996

zbMATH Keywords

ComputabilityEnumerabilityRecursion theoryUnsolvability

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06)

Cited in

(6)

• Small \(\Pi^{0}_{1}\) classes
• scientific article; zbMATH DE number 5761697 (Why is no real title available?)
• scientific article; zbMATH DE number 3926899 (Why is no real title available?)
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• On the interplay between effective notions of randomness and genericity
• Extending the Cooper minimal pair theorem

This page was built for publication:

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