- University of AucklandNZ2 papers
- A. Alikhanyan National LaboratoryAM1 paper
- AGH University of KrakowPL1 paper
- Agricultural University of GeorgiaGE1 paper
- Aix-Marseille UniversitéFR1 paper
- Al Ain UniversityAE1 paper
- Alexandru Ioan Cuza UniversityRO1 paper
- American Committee for the Weizmann Institute of ScienceUS1 paper
- Ankara UniversityTR1 paper
- Argonne National LaboratoryUS1 paper
- Aristotle University of ThessalonikiGR1 paper
- Astronomy AustraliaAU1 paper
Showing math.LOShow all
2 papers · 1 filter
math.LO2026
Computably totally disconnected locally compact groups
Alexander Melnikov, Andre Nies
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ group…
math.LO2026
Characterising SJT reducibility
Noam Greenberg, Andre Nies, Dan Turetsky
SJT reducibility between sets is defined by if for each computable function that is unbounded and nondecreasing, there is an -bound…