Related papers: Logic Blog 2013
The 2012 logic blog has focussed on the following: Randomness and computable analysis/ergodic theory; Systematizing algorithmic randomness notions; Traceability; Higher randomness; Calibrating the complexity of equivalence relations from…
This year's logic blog has focussed on: 1. Demuth randomness 2. traceability 3. The connection of computable analysis and randomness 4. $K$-triviality in metric spaces.
The blog focusses on algorithmic randomness and its connections to quantum information theory, group theory and its connections to logic, and computability analogs of cardinal characteristics.
The 2015 Logic Blog contains a large variety of results connected to logic, some of them unlikely to be submitted to a journal. For the first time there is a group theory part. There are results in higher randomness, and in computable…
This year's blog has focused on the connections of group theory with logic and algorithms. The first post is on automata presentable groups. Then there are several posts related to topological groups, for instance Ivanov and Majcher showing…
The blog is somewhat shorter than in previous years, It contains new insights in a variety of areas, including computability, quantum algorithmic version of the SMB theorem, descriptions of groups (both discrete and profinite), metric…
Some notions from algorithmic randomness are extended to measures and to quantum states. There is a lot on group theory and its relation to logic. This includes some new results on oligomorphic groups. There's also metric spaces and Scott…
The 2014 Logic Blog starts with open questions from the May IMS program in Singapore. It contains results on randomness, including answers to some open questions in higher randomness. There are structural results on equivalence relations,…
The 2022 logic blog has concentrated on the connections of group theory and logic. It discusses Gardam's 2021 refutation of the Higman/ Kaplansky unit conjecture, and its connections to logic and to computation. The rest is about…
This year's logic blog contains a variety of results, some of them available only here. Highlights include the resolution of the Gamma question by Monin, and a number of entries on topological group theory and its connection to logic.…
Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently, Barthe, Hsu and Liao have proposed a new way of giving…
The blog has several entries on group theory interacting with computability and wider logic, several open questions, and an entry on undecidability in physics.
Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…
The program Reverse Mathematics in the foundations of mathematics seeks to identify the minimal axioms required to prove theorems of ordinary mathematics. One always assumes the base theory, a logical system embodying computable…
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computation of probabilities and for reasoning about probabilities,…
We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who…
Analytic concepts contribute to our understanding of randomness of reals via algorithmic tests. They also influence the interplay between randomness and lowness notions. We provide a survey, written on the occasion of Rod Downey's 60th…