55 citations · 164 across the 24 of their papers we have counts for
8 papers · 2 filters
Using almost-everywhere theorems from analysis to study randomness
Kenshi Miyabe, André Nies, Jing Zhang
We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described…
Describing finite groups by short first-order sentences
Andre Nies, Katrin Tent
We say that a class of finite structures for a finite first-order signature is -compressible if each structure in the class has a first-order description of size at most $O(…
Higher Kurtz randomness
Bjørn Kjos-Hanssen, André Nies, Frank Stephan +1
A real is -Kurtz random (-Kurtz random) if it is in no closed null set ( set). We show that there is a cone of -Kurtz random hyperdegrees. W…
Lowness for the class of Schnorr random reals
Bjørn Kjos-Hanssen, André Nies, Frank Stephan
We answer a question of Ambos-Spies and Kučera in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr tests.
Metric Scott analysis
Itai Ben Yaacov, Michal Doucha, Andre Nies +1
We develop an analogue of the classical Scott analysis for metric structures and infinitary continuous logic. Among our results are the existence of Scott sentences for metric stru…
Demuth's path to randomness
Antonín Kučera, André Nies, Christopher P. Porter
Osvald Demuth (1936--1988) studied constructive analysis from the viewpoint of the Russian school of constructive mathematics. In the course of his work he introduced various notio…