Showing math.LOShow all
2 papers · 1 filter
math.LO2022
Computable paradoxical decompositions
Karol Duda, Aleksander Ivanov
We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.
math.LO2021
A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture
Karol Duda
We prove a computable version of the Hall Harem Theorem where the matching realizes a unary function with controlled sizes of cycles. We apply it to non-amenable computable coarse…