Uri Andrews

According to our database1, Uri Andrews authored at least 29 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Expanding the Reals by continuous Functions Adds no Computational Power.
J. Symb. Log., 2023

On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers.
J. Symb. Log., 2023

Limit computability and ultrafilters.
Comput., 2023

2022
The first-order theory of the computably enumerable equivalence relations in the uncountable setting.
J. Log. Comput., 2022

Initial Segments of the Degrees of Ceers.
J. Symb. Log., 2022

Computability and the Symmetric Difference Operator.
Log. J. IGPL, 2022

2021
Effective Inseparability, Lattices, and Preordering Relations.
Rev. Symb. Log., 2021

Is a spectrum of a non-Disintegrated flat strongly Minimal Model Complete Theory in a Language with finite Signature.
J. Symb. Log., 2021

The property "arithmetic-is-recursive" on a cone.
J. Math. Log., 2021

2020
Self-full ceers and the uniform join operator.
J. Log. Comput., 2020

On Isomorphism Classes of computably Enumerable Equivalence Relations.
J. Symb. Log., 2020

The theory of ceers computes true arithmetic.
Ann. Pure Appl. Log., 2020

Scattered sentences have few separable randomizations.
Arch. Math. Log., 2020

2019
Trial and error mathematics: Dialectical systems and completions of theories.
J. Log. Comput., 2019

Independence in randomizations.
J. Math. Log., 2019

Joins and meets in the structure of ceers.
Comput., 2019

2018
Jumps of computably enumerable equivalence relations.
Ann. Pure Appl. Log., 2018

2017
Nondensity of Double Bubbles in the D.C.E. Degrees.
Proceedings of the Computability and Complexity, 2017

A Survey on Universal Computably Enumerable Equivalence Relations.
Proceedings of the Computability and Complexity, 2017

2016
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations.
J. Symb. Log., 2016

The complements of Lower cones of Degrees and the degree spectra of Structures.
J. Symb. Log., 2016

2015
Separable Models of Randomizations.
J. Symb. Log., 2015

Definable closure in randomizations.
Ann. Pure Appl. Log., 2015

2014
Universal computably Enumerable Equivalence Relations.
J. Symb. Log., 2014

Decidable Models of <i>ω</i>-Stable Theories.
J. Symb. Log., 2014

The degrees of bi-hyperhyperimmune sets.
Ann. Pure Appl. Log., 2014

2013
Spectra of atomic theories.
J. Symb. Log., 2013

2011
A new spectrum of recursive models using an amalgamation construction.
J. Symb. Log., 2011

New spectra of strongly minimal theories in finite languages.
Ann. Pure Appl. Log., 2011


  Loading...