New spectra of strongly minimal theories in finite languages. - Uri Andrews (Ann. Pure Appl. Log., 2011)

A new spectrum of recursive models using an amalgamation construction. - Uri Andrews (J. Symb. Log., 2011)

Spectra of atomic theories. - Uri Andrews; Julia F. Knight (J. Symb. Log., 2013)

The degrees of bi-hyperhyperimmune sets. - Uri Andrews; Peter M. Gerdes; Joseph S. Miller (Ann. Pure Appl. Log., 2014)

Decidable Models of ω-Stable Theories. - Uri Andrews (J. Symb. Log., 2014)

Universal computably Enumerable Equivalence Relations. - Uri Andrews; Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (J. Symb. Log., 2014)

Definable closure in randomizations. - Uri Andrews; Isaac Goldbring; H. Jerome Keisler (Ann. Pure Appl. Log., 2015)

Separable Models of Randomizations. - Uri Andrews; H. Jerome Keisler (J. Symb. Log., 2015)

The complements of Lower cones of Degrees and the degree spectra of Structures. - Uri Andrews; Mingzhong Cai; Iskander Sh. Kalimullin; Steffen Lempp; Joseph S. Miller; Antonio Montalbán (J. Symb. Log., 2016)

The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. - Uri Andrews; Andrea Sorbi (J. Symb. Log., 2016)

A Survey on Universal Computably Enumerable Equivalence Relations. - Uri Andrews; Serikzhan A. Badaev; Andrea Sorbi (Computability and Complexity, 2017)

Nondensity of Double Bubbles in the D.C.E. Degrees. - Uri Andrews; Rutger Kuyper; Steffen Lempp; Mariya Ivanova Soskova; Mars M. Yamaleev (Computability and Complexity, 2017)

Jumps of computably enumerable equivalence relations. - Uri Andrews; Andrea Sorbi (Ann. Pure Appl. Log., 2018)

Joins and meets in the structure of ceers. - Uri Andrews; Andrea Sorbi (Comput., 2019)

Independence in randomizations. - Uri Andrews; Isaac Goldbring; H. Jerome Keisler (J. Math. Log., 2019)

Trial and error mathematics: Dialectical systems and completions of theories. - Jacopo Amidei; Uri Andrews; Duccio Pianigiani; Luca San Mauro; Andrea Sorbi (J. Log. Comput., 2019)

Scattered sentences have few separable randomizations. - Uri Andrews; Isaac Goldbring; Sherwood Hachtman; H. Jerome Keisler; David Marker (Arch. Math. Log., 2020)

The theory of ceers computes true arithmetic. - Uri Andrews; Noah Schweber; Andrea Sorbi (Ann. Pure Appl. Log., 2020)

On Isomorphism Classes of computably Enumerable Equivalence Relations. - Uri Andrews; Serikzhan A. Badaev (J. Symb. Log., 2020)

Self-full ceers and the uniform join operator. - Uri Andrews; Noah Schweber; Andrea Sorbi (J. Log. Comput., 2020)

The property "arithmetic-is-recursive" on a cone. - Uri Andrews; Matthew Harrison-Trainor; Noah Schweber (J. Math. Log., 2021)

Is a spectrum of a non-Disintegrated flat strongly Minimal Model Complete Theory in a Language with finite Signature. - Uri Andrews; Omer Mermelstein (J. Symb. Log., 2021)

Effective Inseparability, Lattices, and Preordering Relations. - Uri Andrews; Andrea Sorbi (Rev. Symb. Log., 2021)

Computability and the Symmetric Difference Operator. - Uri Andrews; Peter M. Gerdes; Steffen Lempp; Joseph S. Miller; Noah David Schweber (Log. J. IGPL, 2022)

Initial Segments of the Degrees of Ceers. - Uri Andrews; Andrea Sorbi (J. Symb. Log., 2022)

The first-order theory of the computably enumerable equivalence relations in the uncountable setting. - Uri Andrews; Steffen Lempp; Manat Mustafa; Noah David Schweber (J. Log. Comput., 2022)

Limit computability and ultrafilters. - Uri Andrews; Mingzhong Cai; David Diamondstone; Noah Schweber (Comput., 2023)

On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers. - Uri Andrews; Daniel F. Belin; Luca San Mauro (J. Symb. Log., 2023)

Expanding the Reals by continuous Functions Adds no Computational Power. - Uri Andrews; Julia F. Knight; Rutger Kuyper; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)

On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability. - Uri Andrews; Luca San Mauro (SAFA@COMMA, 2024)

On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions. - Uri Andrews; Luca San Mauro (FCR@KI, 2024)

On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions. - Uri Andrews; Luca San Mauro (NMR, 2024)

Investigating the Computable Friedman-Stanley jump. - Uri Andrews; Luca San Mauro (J. Symb. Log., 2024)

Two results on complexities of decision problems of groups. - Uri Andrews; Matthew Harrison-Trainor; Meng-Che Ho (Int. J. Algebra Comput., 2025)

Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version). - Uri Andrews; Luca San Mauro (CoRR, 2025)

SCC-recursiveness in infinite argumentation (extended version). - Uri Andrews; Luca San Mauro (CoRR, 2025)