Logic Blog 2013
Abstract
The 2013 logic blog has focussed on the following: 1. Higher randomness. Among others, the Borel complexity of 11 randomness and higher weak 2 randomness is determined. 2. Reverse mathematics and its relationship to randomness. For instance, what is the strength of Jordan's theorem in analysis? (His theorem states that each function of bounded variation is the difference of two nondecreasing functions.) 3. Randomness and computable analysis. This focusses on the connection of randomness of a real z and Lebesgue density of effectively closed sets at z. 4. Exploring similarity relations for Polish metric spaces, such as isometry, or having Gromov-Hausdorff distance 0. In particular their complexity was studied. 5. Various results connecting computability theory and randomness.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.