scientific article; zbMATH DE number 5354051

MaRDI QIDQ3530400zbMATH OpenFDO

Authors André Nies

Publication date 20 October 2008

zbMATH Keywords

randomnesssurvey

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Eliminating dummy elimination
• Elimination of conditions
• The elimination of De Re modalities
• Elimination methods
• Reflections on elimination theory
• Elimination of negation in a logical framework
• EG-eliminations
• Eliminating ditransitives
• Eliminating disjunctions by disjunction elimination
• Eliminating disjunctions by disjunction elimination

Cited in

(4)

• Non-cupping and randomness
• 𝐾-trivial degrees and the jump-traceability hierarchy
• Strong jump-traceability
• Inherent enumerability of strong jump-traceability

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 Q3530400)