7 citations · 19 across the 14 of their papers we have counts for
4 papers · 1 filter
Trial and error mathematics: Dialectical systems and completions of theories
Jacopo Amidei, Uri Andrews, Duccio Pianigiani +2
This paper is part of a project that is based on the notion of dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In previous work, we inve…
Classifying equivalence relations in the Ershov hierarchy
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro +2
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\…
Comparing the degrees of enumerability and the closed Medvedev degrees
Paul Shafer, Andrea Sorbi
We compare the degrees of enumerability and the closed Medvedev degrees and find that many situations occur. There are nonzero closed degrees that do not bound nonzero degrees of e…
Joins and meets in the structure of Ceers
Uri Andrews, Andrea Sorbi
We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducibility, and we investigate the resulting degree structure Ceers, which is a poset…