A. Sorbi

activity

20062026

most citedEffective inseparability, lattices, and pre-ordering relations

7 citations · 19 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.LO2019

Self-full ceers and the uniform join operator

Uri Andrews, Noah Schweber, Andrea Sorbi

A computably enumerable equivalence relation (ceer) $X$ is called self-full if whenever $f$ is a reduction of $X$ to $X$ then the range of $f$ intersects all $X$ -equivalence classe…

math.LO2019

The Theory of Ceers Computes True Arithmetic

Uri Andrews, Noah Schweber, Andrea Sorbi

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same…

math.LO2019★ 7 cited

Effective inseparability, lattices, and pre-ordering relations

Uri Andrews, Andrea Sorbi

We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L = ⟨ ω, \land, \lor, 0, 1, \leq_{L} ⟩$ where $ω$ denotes the set of natural numbers and…