7 citations · 8 across the 2 of their papers we have counts for
7 papers · 1 filter
Recursive spectra of flat strongly minimal theories
Uri Andrews, Omer Mermelstein
We show that for a model complete strongly minimal theory whose pregeometry is flat, the recursive spectrum (SRM()) is either of the form for or $[0,n]\cup\{ω…
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…
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…
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…