20 citations · 30 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature
Uri Andrews, Omer Mermelstein
We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite signature…
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…