Uri Andrews

From MaRDI portal
(Redirected from Person:375900)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Comparing dialectical systems: contradiction and counterexample in belief change2025-12-15Paper
SCC-recursiveness in infinite argumentation2025-12-15Paper
Complexity profiles and generic Muchnik reducibility
Advances in Mathematics
2023-12-21Paper
Limit computability and ultrafilters
Computability
2023-09-13Paper
ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
Journal of Symbolic Logic
2023-09-11Paper
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
Journal of Symbolic Logic
2023-09-11Paper
Initial segments of the degrees of ceers
Journal of Symbolic Logic
2022-08-29Paper
Computability and the symmetric difference operator
Logic Journal of the IGPL
2022-07-22Paper
Investigating the computable Friedman-Stanley jump2022-06-23Paper
The first-order theory of the computably enumerable equivalence relations in the uncountable setting
Journal Of Logic And Computation
2022-02-08Paper
EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
The Review of Symbolic Logic
2022-02-07Paper
IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATURE
Journal of Symbolic Logic
2022-01-17Paper
Recursive spectra of flat strongly minimal theories
Proceedings of the American Mathematical Society
2021-11-09Paper
The property ``arithmetic-is-recursive on a cone
Journal of Mathematical Logic
2021-11-03Paper
Self-full ceers and the uniform join operator
Journal Of Logic And Computation
2021-10-21Paper
Building models of strongly minimal theories
Advances in Mathematics
2021-07-05Paper
Scattered sentences have few separable randomizations
Archive for Mathematical Logic
2020-07-17Paper
The theory of ceers computes true arithmetic
Annals of Pure and Applied Logic
2020-06-02Paper
On isomorphism classes of computably enumerable equivalence relations
Journal of Symbolic Logic
2020-04-17Paper
Joins and meets in the structure of ceers
Computability
2020-01-17Paper
Characterizing the continuous degrees
Israel Journal of Mathematics
2019-12-17Paper
$[0,n\cup \{\omega\}$ is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature]
(available as arXiv preprint)
2019-08-25Paper
Independence in randomizations
Journal of Mathematical Logic
2019-07-08Paper
On cototality and the skip operator in the enumeration degrees
Transactions of the American Mathematical Society
2019-07-03Paper
Trial and error mathematics: Dialectical systems and completions of theories
Journal Of Logic And Computation
2019-03-01Paper
Trial and error mathematics: Dialectical systems and completions of theories
Journal Of Logic And Computation
2019-03-01Paper
Effective inseparability, lattices, and pre-ordering relations
(available as arXiv preprint)
2019-01-18Paper
Definable sets containing productsets in expansions of groups
Journal of Group Theory
2019-01-09Paper
Hindman's theorem and idempotent types
Semigroup Forum
2018-12-21Paper
Strongly minimal theories with recursive models
Journal of the European Mathematical Society (JEMS)
2018-06-21Paper
Jumps of computably enumerable equivalence relations
Annals of Pure and Applied Logic
2018-01-11Paper
Theory spectra and classes of theories
Transactions of the American Mathematical Society
2017-06-14Paper
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
Journal of Symbolic Logic
2017-04-28Paper
The complexity of index sets of classes of computably enumerable equivalence relations
Journal of Symbolic Logic
2017-04-28Paper
A survey on universal computably enumerable equivalence relations
Computability and Complexity
2017-04-04Paper
Nondensity of Double Bubbles in the D.C.E. Degrees
Computability and Complexity
2017-04-04Paper
Algebraic Independence Relations in Randomizations2017-03-31Paper
Asymptotic density, computable traceability, and 1-randomness
Fundamenta Mathematicae
2016-07-08Paper
Comparing classes of finite sums
Algebra and Logic
2016-05-12Paper
Separable models of randomizations
The Journal of Symbolic Logic
2016-03-22Paper
A local characterization of VC-minimality
Proceedings of the American Mathematical Society
2016-03-08Paper
On the structure of the degrees of relative provability
Israel Journal of Mathematics
2015-06-26Paper
Spectra of theories and structures
Proceedings of the American Mathematical Society
2015-02-02Paper
Definable closure in randomizations
Annals of Pure and Applied Logic
2015-01-23Paper
Decidable models of \(\omega\)-stable theories
The Journal of Symbolic Logic
2014-09-30Paper
Universal computably enumerable equivalence relations
The Journal of Symbolic Logic
2014-09-30Paper
Independence relations in randomizations2014-09-04Paper
Spectra of atomic theories
Journal of Symbolic Logic
2014-04-04Paper
Spectra of atomic theories
Journal of Symbolic Logic
2014-04-04Paper
Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy
Transactions of the American Mathematical Society
2014-03-12Paper
The degrees of bi-hyperhyperimmune sets
Annals of Pure and Applied Logic
2013-12-16Paper
The index set of uncountably categorical theories
Israel Journal of Mathematics
2013-11-01Paper
The degrees of categorical theories with recursive models
Proceedings of the American Mathematical Society
2013-07-05Paper
A new spectrum of recursive models using an amalgamation construction
Journal of Symbolic Logic
2011-10-10Paper
New spectra of strongly minimal theories in finite languages
Annals of Pure and Applied Logic
2011-09-12Paper
Algorithmically finite, universal, and $*$-universal groups
(available as arXiv preprint)
N/APaper
The Borel complexity of the class of models of first-order theories
(available as arXiv preprint)
N/APaper
A jump operator on the Weihrauch degrees
(available as arXiv preprint)
N/APaper
Two results on complexities of decision problems of groups
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Uri Andrews