3 papers
cs.LO2020
Learnability and Positive Equivalence Relations
David Belanger, Ziyuan Gao, Sanjay Jain +2
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence…
cs.LO2019
Random Subgroups of Rationals
Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov +4
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup of rationals, two main…
math.LO2018
On The Computability of Perfect Subsets of Sets with Positive Measure
Chitat Chong, Wei Li, Wei Wang +1
A set with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak c…