Uri Andrews

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 24

Top Topics

Rough Set Approximations

Granular Computing

Equivalence Relation

Top Venues

Ann. Pure Appl. Log.

J. Log. Comput.

Publications

Uri Andrews, Luca San Mauro
Investigating the Computable Friedman-Stanley jump. J. Symb. Log. 89 (2) (2024)
Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber
Limit computability and ultrafilters. Comput. 12 (2) (2023)
Uri Andrews, Daniel F. Belin, Luca San Mauro
On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers. J. Symb. Log. 88 (3) (2023)
Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller, Mariya Ivanova Soskova
Expanding the Reals by continuous Functions Adds no Computational Power. J. Symb. Log. 88 (3) (2023)
Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber
Computability and the Symmetric Difference Operator. Log. J. IGPL 30 (3) (2022)
Uri Andrews, Andrea Sorbi
Initial Segments of the Degrees of Ceers. J. Symb. Log. 87 (3) (2022)
Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber
The first-order theory of the computably enumerable equivalence relations in the uncountable setting. J. Log. Comput. 32 (1) (2022)
Uri Andrews, Andrea Sorbi
Effective Inseparability, Lattices, and Preordering Relations. Rev. Symb. Log. 14 (4) (2021)
Uri Andrews, Omer Mermelstein
Is a spectrum of a non-Disintegrated flat strongly Minimal Model Complete Theory in a Language with finite Signature. J. Symb. Log. 86 (4) (2021)
Uri Andrews, Matthew Harrison-Trainor, Noah Schweber
The property "arithmetic-is-recursive" on a cone. J. Math. Log. 21 (3) (2021)
Uri Andrews, Noah Schweber, Andrea Sorbi
The theory of ceers computes true arithmetic. Ann. Pure Appl. Log. 171 (8) (2020)
Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler, David Marker
Scattered sentences have few separable randomizations. Arch. Math. Log. 59 (5-6) (2020)
Uri Andrews, Noah Schweber, Andrea Sorbi
Self-full ceers and the uniform join operator. J. Log. Comput. 30 (3) (2020)
Uri Andrews, Serikzhan A. Badaev
On Isomorphism Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 85 (1) (2020)
Uri Andrews, Isaac Goldbring, H. Jerome Keisler
Independence in randomizations. J. Math. Log. 19 (1) (2019)
Uri Andrews, Andrea Sorbi
Joins and meets in the structure of ceers. Comput. 8 (3-4) (2019)
Jacopo Amidei, Uri Andrews, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
Trial and error mathematics: Dialectical systems and completions of theories. J. Log. Comput. 29 (1) (2019)
Uri Andrews, Andrea Sorbi
Jumps of computably enumerable equivalence relations. Ann. Pure Appl. Log. 169 (3) (2018)
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity (2017)
Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity (2017)
Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán
The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. 81 (3) (2016)
Uri Andrews, Andrea Sorbi
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 81 (4) (2016)
Uri Andrews, H. Jerome Keisler
Separable Models of Randomizations. J. Symb. Log. 80 (4) (2015)
Uri Andrews, Isaac Goldbring, H. Jerome Keisler
Definable closure in randomizations. Ann. Pure Appl. Log. 166 (3) (2015)
Uri Andrews
-Stable Theories. J. Symb. Log. 79 (1) (2014)
Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79 (1) (2014)
Uri Andrews, Peter Gerdes, Joseph S. Miller
The degrees of bi-hyperhyperimmune sets. Ann. Pure Appl. Log. 165 (3) (2014)
Uri Andrews, Julia F. Knight
Spectra of atomic theories. J. Symb. Log. 78 (4) (2013)
Uri Andrews
New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Log. 162 (5) (2011)
Uri Andrews
A new spectrum of recursive models using an amalgamation construction. J. Symb. Log. 76 (3) (2011)