Uri Andrews

According to our database, Uri Andrews authored at least 33 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Investigating the Computable Friedman-Stanley jump.

Uri Andrews, Luca San Mauro

J. Symb. Log., 2024

On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions.

Uri Andrews, Luca San Mauro

Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR 2024) co-located with 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), 2024

On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions.

Uri Andrews, Luca San Mauro

Proceedings of the 10th Workshop on Formal and Cognitive Reasoning co-located with the 47th German Conference on Artificial Intelligence (KI 2024), 2024

On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability.

Uri Andrews, Luca San Mauro

Proceedings of the Fifth International Workshop on Systems and Algorithms for Formal Argumentation co-located with 10th International Conference on Computational Models of Argument (COMMA 2024), 2024

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 the Structure of Computable Reducibility on Equivalence Relations of Natural numbers.

Uri Andrews, Daniel F. Belin, Luca San Mauro

J. Symb. Log., 2023

Limit computability and ultrafilters.

Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber

Comput., 2023

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

Initial Segments of the Degrees of Ceers.

Uri Andrews, Andrea Sorbi

J. Symb. Log., 2022

Computability and the Symmetric Difference Operator.

Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber

Log. J. IGPL, 2022

2021

Effective Inseparability, Lattices, and Preordering Relations.

Uri Andrews, Andrea Sorbi

Rev. Symb. 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

The property "arithmetic-is-recursive" on a cone.

Uri Andrews, Matthew Harrison-Trainor, Noah Schweber

J. Math. Log., 2021

2020

Self-full ceers and the uniform join operator.

Uri Andrews, Noah Schweber, Andrea Sorbi

J. Log. Comput., 2020

On Isomorphism Classes of computably Enumerable Equivalence Relations.

Uri Andrews, Serikzhan A. Badaev

J. Symb. Log., 2020

The theory of ceers computes true arithmetic.

Uri Andrews, Noah Schweber, Andrea Sorbi

Ann. Pure Appl. Log., 2020

Scattered sentences have few separable randomizations.

Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler, David Marker

Arch. Math. Log., 2020

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

Independence in randomizations.

Uri Andrews, Isaac Goldbring, H. Jerome Keisler

J. Math. Log., 2019

Joins and meets in the structure of ceers.

Uri Andrews, Andrea Sorbi

Comput., 2019

2018

Jumps of computably enumerable equivalence relations.

Uri Andrews, Andrea Sorbi

Ann. Pure Appl. Log., 2018

2017

Nondensity of Double Bubbles in the D.C.E. Degrees.

Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev

Proceedings of the Computability and Complexity, 2017

A Survey on Universal Computably Enumerable Equivalence Relations.

Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi

Proceedings of the Computability and Complexity, 2017

2016

The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations.

Uri Andrews, Andrea Sorbi

J. Symb. Log., 2016

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

2015

Separable Models of Randomizations.

Uri Andrews, H. Jerome Keisler

J. Symb. Log., 2015

Definable closure in randomizations.

Uri Andrews, Isaac Goldbring, H. Jerome Keisler

Ann. Pure Appl. Log., 2015

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

Decidable Models of <i>ω</i>-Stable Theories.

Uri Andrews

J. Symb. Log., 2014

The degrees of bi-hyperhyperimmune sets.

Uri Andrews, Peter M. Gerdes, Joseph S. Miller

Ann. Pure Appl. Log., 2014

2013

Spectra of atomic theories.

Uri Andrews, Julia F. Knight

J. Symb. Log., 2013

2011

A new spectrum of recursive models using an amalgamation construction.

Uri Andrews

J. Symb. Log., 2011

New spectra of strongly minimal theories in finite languages.

Uri Andrews

Ann. Pure Appl. Log., 2011