default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUri Andrews
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Uri Andrews, Luca San Mauro
:
Investigating the Computable Friedman-Stanley jump. J. Symb. Log. 89(2): 918-944 (2024)- [c4]Uri Andrews, Luca San Mauro:
On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability. SAFA@COMMA 2024: 12-26 - [c3]Uri Andrews, Luca San Mauro:
On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions. FCR@KI 2024: 35-47 - 2023
- [j27]Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber:
Limit computability and ultrafilters. Comput. 12(2): 101-115 (2023) - [j26]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): 1038-1063 (2023) - [j25]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): 1083-1102 (2023) - 2022
- [j24]Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber:
Computability and the Symmetric Difference Operator. Log. J. IGPL 30(3): 499-518 (2022) - [j23]Uri Andrews, Andrea Sorbi:
Initial Segments of the Degrees of Ceers. J. Symb. Log. 87(3): 1260-1282 (2022) - [j22]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): 98-114 (2022) - 2021
- [j21]Uri Andrews, Matthew Harrison-Trainor, Noah Schweber:
The property "arithmetic-is-recursive" on a cone. J. Math. Log. 21(3): 2150021:1-2150021:18 (2021) - [j20]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): 1632-1656 (2021) - [j19]Uri Andrews, Andrea Sorbi:
Effective Inseparability, Lattices, and Preordering Relations. Rev. Symb. Log. 14(4): 838-865 (2021) - 2020
- [j18]Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler, David Marker:
Scattered sentences have few separable randomizations. Arch. Math. Log. 59(5-6): 743-754 (2020) - [j17]Uri Andrews, Noah Schweber, Andrea Sorbi:
The theory of ceers computes true arithmetic. Ann. Pure Appl. Log. 171(8): 102811 (2020) - [j16]Uri Andrews, Serikzhan A. Badaev:
On Isomorphism Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 85(1): 61-86 (2020) - [j15]Uri Andrews, Noah Schweber, Andrea Sorbi:
Self-full ceers and the uniform join operator. J. Log. Comput. 30(3): 765-783 (2020)
2010 – 2019
- 2019
- [j14]Uri Andrews, Andrea Sorbi:
Joins and meets in the structure of ceers. Comput. 8(3-4): 193-241 (2019) - [j13]Uri Andrews, Isaac Goldbring, H. Jerome Keisler:
Independence in randomizations. J. Math. Log. 19(1): 1950005:1-1950005:42 (2019) - [j12]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): 157-184 (2019) - 2018
- [j11]Uri Andrews, Andrea Sorbi:
Jumps of computably enumerable equivalence relations. Ann. Pure Appl. Log. 169(3): 243-259 (2018) - 2017
- [c2]Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi:
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity 2017: 418-451 - [c1]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: 547-562 - 2016
- [j10]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): 997-1006 (2016) - [j9]Uri Andrews, Andrea Sorbi:
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 81(4): 1375-1395 (2016) - 2015
- [j8]Uri Andrews, Isaac Goldbring, H. Jerome Keisler:
Definable closure in randomizations. Ann. Pure Appl. Log. 166(3): 325-341 (2015) - [j7]Uri Andrews, H. Jerome Keisler:
Separable Models of Randomizations. J. Symb. Log. 80(4): 1149-1181 (2015) - 2014
- [j6]Uri Andrews, Peter M. Gerdes, Joseph S. Miller:
The degrees of bi-hyperhyperimmune sets. Ann. Pure Appl. Log. 165(3): 803-811 (2014) - [j5]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): 60-88 (2014) - [j4]Uri Andrews:
Decidable Models of ω-Stable Theories. J. Symb. Log. 79(1): 186-192 (2014) - 2013
- [j3]Uri Andrews, Julia F. Knight:
Spectra of atomic theories. J. Symb. Log. 78(4): 1189-1198 (2013) - 2011
- [j2]Uri Andrews:
New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Log. 162(5): 367-372 (2011) - [j1]Uri Andrews:
A new spectrum of recursive models using an amalgamation construction. J. Symb. Log. 76(3): 883-896 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
