7 citations · 8 across the 2 of their papers we have counts for
4 papers
Self-full ceers and the uniform join operator
Uri Andrews, Noah Schweber, Andrea Sorbi
A computably enumerable equivalence relation (ceer) is called self-full if whenever is a reduction of to then the range of intersects all -equivalence classe…
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…
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 where denotes the set of natural numbers and…
Algebraic Independence Relations in Randomizations
Uri Andrews, Isaac Goldbring, H. Jerome Keisler
We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations of complete first order theories…