Uri Andrews - RankMe

43 papers A 1B 1Journal 33Unranked 8

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A jump operator on the Weihrauch degrees. Comput. Uri Andrews, Steffen Lempp, Alberto Marcone, Joseph S. Miller, Manlio Valenti
2025	J	`jnl`	Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version). CoRR Uri Andrews, Luca San Mauro
2025	—	`conf`	Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change. JELIA (2) Uri Andrews, Luca San Mauro
2025	A	`conf`	Complexity in Finitary Argumentation. ECAI Uri Andrews, Luca San Mauro
2025	J	`jnl`	Complexity in finitary argumentation (extended version). CoRR Uri Andrews, Luca San Mauro
2025	B	`conf`	On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks. TARK Uri Andrews, Luca San Mauro
2025	—	`conf`	SCC-Recursiveness in Infinite Argumentation. JELIA (1) Uri Andrews, Luca San Mauro
2025	J	`jnl`	SCC-recursiveness in infinite argumentation (extended version). CoRR Uri Andrews, Luca San Mauro
2025	J	`jnl`	Two results on complexities of decision problems of groups. Int. J. Algebra Comput. Uri Andrews, Matthew Harrison-Trainor, Meng-Che Ho
2024	J	`jnl`	Investigating the Computable Friedman-Stanley jump. J. Symb. Log. Uri Andrews, Luca San Mauro
2024	—	`conf`	On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability. SAFA Uri Andrews, Luca San Mauro
2024	—	`conf`	On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions. AI³@AI*IA Uri Andrews, Luca San Mauro
2024	—	`conf`	On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions. FCR@KI Uri Andrews, Luca San Mauro
2024	—	`conf`	On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions. NMR Uri Andrews, Luca San Mauro
2023	J	`jnl`	Expanding the Reals by continuous Functions Adds no Computational Power. J. Symb. Log. Uri Andrews, Julia F. Knight, Rutger Kuyper, Joseph S. Miller, Mariya Ivanova Soskova
2023	J	`jnl`	Limit computability and ultrafilters. Comput. Uri Andrews, Mingzhong Cai, David Diamondstone, Noah Schweber
2023	J	`jnl`	On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers. J. Symb. Log. Uri Andrews, Daniel F. Belin, Luca San Mauro
2022	J	`jnl`	Computability and the Symmetric Difference Operator. Log. J. IGPL Uri Andrews, Peter M. Gerdes, Steffen Lempp, Joseph S. Miller, Noah David Schweber
2022	J	`jnl`	Initial Segments of the Degrees of Ceers. J. Symb. Log. Uri Andrews, Andrea Sorbi
2022	J	`jnl`	The first-order theory of the computably enumerable equivalence relations in the uncountable setting. J. Log. Comput. Uri Andrews, Steffen Lempp, Manat Mustafa, Noah David Schweber
2021	J	`jnl`	Effective Inseparability, Lattices, and Preordering Relations. Rev. Symb. Log. Uri Andrews, Andrea Sorbi
2021	J	`jnl`	Is a spectrum of a non-Disintegrated flat strongly Minimal Model Complete Theory in a Language with finite Signature. J. Symb. Log. Uri Andrews, Omer Mermelstein
2021	J	`jnl`	The property "arithmetic-is-recursive" on a cone. J. Math. Log. Uri Andrews, Matthew Harrison-Trainor, Noah Schweber
2020	J	`jnl`	On Isomorphism Classes of computably Enumerable Equivalence Relations. J. Symb. Log. Uri Andrews, Serikzhan A. Badaev
2020	J	`jnl`	Scattered sentences have few separable randomizations. Arch. Math. Log. Uri Andrews, Isaac Goldbring, Sherwood Hachtman, H. Jerome Keisler, David Marker
2020	J	`jnl`	Self-full ceers and the uniform join operator. J. Log. Comput. Uri Andrews, Noah Schweber, Andrea Sorbi
2020	J	`jnl`	The theory of ceers computes true arithmetic. Ann. Pure Appl. Log. Uri Andrews, Noah Schweber, Andrea Sorbi
2019	J	`jnl`	Independence in randomizations. J. Math. Log. Uri Andrews, Isaac Goldbring, H. Jerome Keisler
2019	J	`jnl`	Joins and meets in the structure of ceers. Comput. Uri Andrews, Andrea Sorbi
2019	J	`jnl`	Trial and error mathematics: Dialectical systems and completions of theories. J. Log. Comput. Jacopo Amidei, Uri Andrews, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
2018	J	`jnl`	Jumps of computably enumerable equivalence relations. Ann. Pure Appl. Log. Uri Andrews, Andrea Sorbi
2017	—	`conf`	A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
2017	—	`conf`	Nondensity of Double Bubbles in the D.C.E. Degrees. Computability and Complexity Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev
2016	J	`jnl`	The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. J. Symb. Log. Uri Andrews, Andrea Sorbi
2016	J	`jnl`	The complements of Lower cones of Degrees and the degree spectra of Structures. J. Symb. Log. Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán
2015	J	`jnl`	Definable closure in randomizations. Ann. Pure Appl. Log. Uri Andrews, Isaac Goldbring, H. Jerome Keisler
2015	J	`jnl`	Separable Models of Randomizations. J. Symb. Log. Uri Andrews, H. Jerome Keisler
2014	J	`jnl`	Decidable Models of J. Symb. Log. Uri Andrews
2014	J	`jnl`	The degrees of bi-hyperhyperimmune sets. Ann. Pure Appl. Log. Uri Andrews, Peter M. Gerdes, Joseph S. Miller
2014	J	`jnl`	Universal computably Enumerable Equivalence Relations. J. Symb. Log. Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
2013	J	`jnl`	Spectra of atomic theories. J. Symb. Log. Uri Andrews, Julia F. Knight
2011	J	`jnl`	A new spectrum of recursive models using an amalgamation construction. J. Symb. Log. Uri Andrews
2011	J	`jnl`	New spectra of strongly minimal theories in finite languages. Ann. Pure Appl. Log. Uri Andrews