Zobrazeno 1 - 10
of 141
pro vyhledávání: '"André Nies"'
Publikováno v:
The Journal of Symbolic Logic. :1-21
The tower number ${\mathfrak t}$ and the ultrafilter number $\mathfrak {u}$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $\omega $ and the almost inclusion relation $\subseteq ^*$ b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::531f24ad945c73ba827eeec87d2917fa
https://doi.org/10.1017/jsl.2022.60
https://doi.org/10.1017/jsl.2022.60
Autor:
Frank Stephan, André Nies
Publikováno v:
Theoretical Computer Science. 900:1-19
We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure μ on the space of infinite bit sequences is Martin-Lof absolutely continuous if the non-Martin-Lof random bit sequences form a null set with r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ac64b56a35abd08dd6ce3ec627f260b
https://doi.org/10.1016/j.tcs.2021.11.003
https://doi.org/10.1016/j.tcs.2021.11.003
Publikováno v:
Proceedings of the London Mathematical Society. 123:597-635
A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various kinds are FA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::525efb3b67c4407417230ccc49c81294
https://doi.org/10.1112/plms.12420
https://doi.org/10.1112/plms.12420
Publikováno v:
The Journal of Symbolic Logic. 86:913-934
The general theory developed by Ben Yaacov for metric structures provides Fraïssé limits which are approximately ultrahomogeneous. We show here that this result can be strengthened in the case of relational metric structures. We give an extra condi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb30515e6fc1504ea7ecf5117353155f
https://doi.org/10.1017/jsl.2021.65
https://doi.org/10.1017/jsl.2021.65
Autor:
Benoit Monin, André Nies
Publikováno v:
The Journal of Symbolic Logic. 86:471-498
For $p \in [0,1]$ let $\mathcal D(p)$ be the mass problem of infinite bit sequences~$y$ (i.e., $\{0,1\}$-valued functions) such that for each computable bit sequence $x$, the bit sequence $ x \leftrightarrow y$ has asymptotic lower density at most $p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4ece6a4d0fefe7c12d5997243d38ad3
https://doi.org/10.1017/jsl.2020.1
https://doi.org/10.1017/jsl.2020.1
Publikováno v:
Proceedings of the American Mathematical Society. 146:5421-5435
We apply methods of computable structure theory to study effectively closed subgroups of S ∞ S_\infty . The main result of the paper says that there exists an effectively closed presentation of Z 2 \mathbb {Z}_2 which is not the automorphism group
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df51e92341ec5e0cde9bfeea3163383a
https://doi.org/10.1090/proc/14055
https://doi.org/10.1090/proc/14055
Publikováno v:
Journal of Logic and Analysis. :1-13
We consider the behaviour of Schnorr randomness, a randomness notion weaker than Martin-L o f's, for left-r.e. reals under Solovay reducibility. Contrasting with results on Martin-L o f-randomenss, we show that Schnorr randomness is not upward closed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fea834d4427c13f327fbf2ac5737c624
https://doi.org/10.4115/jla.2018.10.3
https://doi.org/10.4115/jla.2018.10.3
Publikováno v:
Analysis and Geometry in Metric Spaces, Vol 5, Iss 1, Pp 138-151 (2017)
The Urysohn space is a separable complete metric space with two fundamental properties: (a) universality: every separable metric space can be isometrically embedded in it; (b) ultrahomogeneity: every finite isometry between two finite subspaces can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5532d63afac68857c667be132767296c
https://doi.org/10.1515/agms-2017-0008
https://doi.org/10.1515/agms-2017-0008
Publikováno v:
Notre Dame J. Formal Logic 60, no. 3 (2019), 491-502
This work contributes to the program of studying effective versions of “almost-everywhere” theorems in analysis and ergodic theory via algorithmic randomness. Consider the setting of Cantor space $\{0,1\}^{{\mathbb{N}}}$ with the uniform measure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc1fcfabbb615f6adc69df60b78d3653
https://projecteuclid.org/euclid.ndjfl/1562810592
https://projecteuclid.org/euclid.ndjfl/1562810592
Autor:
André Nies
Publikováno v:
complexity, logic, and recursion theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee1b7372ae9b5458517e77f265e65405
https://doi.org/10.1201/9780429187490-9
https://doi.org/10.1201/9780429187490-9