首页/论文/2003.03361

arXiv 2003.033612020-03math.LOmath.GR

Logic Blog 2019

Andre Nies

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Logic Blog 2011

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.

2014-03-23math.LO

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 computability theory and algebra.

2013-02-15math.LO

Logic Blog 2013

The 2013 logic blog has focussed on the following: 1. Higher randomness. Among others, the Borel complexity of $Π^1_1$ 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…

2014-06-19math.LO

Logic Blog 2021

The blog has several entries on group theory interacting with computability and wider logic, several open questions, and an entry on undecidability in physics.

2022-02-28math.GRmath.LO

Logic Blog 2022

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 topological groups of various kinds, in particular a computational theory of tdlc groups, and a duality between locally Roelcke precompact groups and certain countable structures called meet groupoids.

2023-02-23math.GRmath.LO

Logic Blog 2015f

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 ergodic theory.

2016-02-14math.LO

更多相关论文收起更多论文

逻辑博客 2023-2024

Logic Blog 2023-2024

该文合并2023至2024年的逻辑博客，汇集特定群类与逻辑关系、遍历理论、数学基础及AI定理证明等条目。

2025-03-16math.LO

Logic Blog 2017

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 spaces. There are also lots of open questions in computability, randomness, and computable model theory.

2018-04-15math.LO

Logic Blog 2018

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 rank, and interpretability.

2019-03-14math.LO

Logic Blog 2014

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, and metric spaces. The last 20 pages contain a tutorial [arXiv:1407.4259] by Bienvenu and Shen on the coincidence of K-trivial and low for K, and related results. They formulate the golden run in game theoretic language.

2015-04-30math.LO

Logic Blog 2016

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. There's also a new proof by Yu of Harrington's 1978 result that a Pi-11 set of hyperdegrees with a perfect subset contains an upper cone. Also there's quite a bit of reverse mathematics, including its connection to randomness, and variants of Hindman's theorem in this setting.

2017-03-09math.LO

Logic Blog 2020

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 that extreme amenability of closed subgroups of $S_\infty$ is a Borel property. One post due to Harrison-Trainor and Nies reviews notes by Segal on pseudofinite groups, and attempts an effective version. About 25 percent is on computability and randomness, in particular equivalence of reducibilities weaker than Turing on the K-trivials by Greenberg, Nies an…

2021-01-23math.LO