Andrea Sorbi

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 27

Top Topics

Recursively Enumerable

Rough Set Approximations

Top Venues

Arch. Math. Log.

J. Log. Comput.

Rev. Symb. Log.

Publications

Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. J. Log. Comput. 33 (5) (2023)
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
Classifying word problems of finitely generated algebras via computable reducibility. Int. J. Algebra Comput. 33 (4) (2023)
Uri Andrews, Andrea Sorbi
Initial Segments of the Degrees of Ceers. J. Symb. Log. 87 (3) (2022)
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11 (3-4) (2022)
Andrea Sorbi
Effective Inseparability and Its Applications. CiE (2021)
Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi
Notes on conjunctive and Quasi degrees. J. Log. Comput. 31 (5) (2021)
Uri Andrews, Andrea Sorbi
Effective Inseparability, Lattices, and Preordering Relations. Rev. Symb. Log. 14 (4) (2021)
Duccio Pianigiani, Andrea Sorbi
A note on uniform density in weak arithmetical theories. Arch. Math. Log. 60 (1-2) (2021)
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev
Classifying equivalence relations in the Ershov hierarchy. Arch. Math. Log. 59 (7-8) (2020)
Uri Andrews, Noah Schweber, Andrea Sorbi
The theory of ceers computes true arithmetic. Ann. Pure Appl. Log. 171 (8) (2020)
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
Word problems and ceers. Math. Log. Q. 66 (3) (2020)
Uri Andrews, Noah Schweber, Andrea Sorbi
Self-full ceers and the uniform join operator. J. Log. Comput. 30 (3) (2020)
Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Log. 59 (7-8) (2020)
Uri Andrews, Andrea Sorbi
Joins and meets in the structure of ceers. Comput. 8 (3-4) (2019)
Paul Shafer, Andrea Sorbi
Comparing the degrees of enumerability and the closed Medvedev degrees. Arch. Math. Log. 58 (5-6) (2019)
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) (2019)
Richard Elwes, Andy Lewis-Pye, Benedikt Löwe, Dugald Macpherson, Dag Normann, Andrea Sorbi, Alexandra A. Soskova, Mariya Ivanova Soskova, Peter van Emde Boas, Stanley S. Wainer
S. Barry Cooper (1943-2015). Comput. 7 (2-3) (2018)
André Nies, Andrea Sorbi
Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28 (3) (2018)
Uri Andrews, Andrea Sorbi
Jumps of computably enumerable equivalence relations. Ann. Pure Appl. Log. 169 (3) (2018)
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity (2017)
Hristo Ganchev, Andrea Sorbi
Enumeration Degrees. J. Symb. Log. 81 (1) (2016)
Andrew Lewis-Pye, Andrea Sorbi
In Memoriam: Barry Cooper 1943-2015. Bull. Symb. Log. 22 (3) (2016)
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets. Rev. Symb. Log. 9 (4) (2016)
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi, Andrea Sorbi
Trial and error Mathematics I: Dialectical and Quasidialectical Systems. Rev. Symb. Log. 9 (2) (2016)
Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent, Andrea Sorbi
A note on the enumeration degrees of 1-generic sets. Arch. Math. Log. 55 (3-4) (2016)
Serikzhan A. Badaev, Andrea Sorbi
Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62 (1-2) (2016)
Uri Andrews, Andrea Sorbi
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 81 (4) (2016)
Franco Montagna, Giulia Simi, Andrea Sorbi
Taking the Pirahã seriously. Commun. Nonlinear Sci. Numer. Simul. 21 (1-3) (2015)
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
Friedberg numberings in the Ershov hierarchy. Arch. Math. Log. 54 (1-2) (2015)
Andrea Sorbi, Sebastiaan A. Terwijn
Generalizations of the Weak Law of the Excluded Middle. Notre Dame J. Formal Log. 56 (2) (2015)
Theodore A. Slaman, Andrea Sorbi
A note on initial Segments of the Enumeration Degrees. J. Symb. Log. 79 (2) (2014)
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) (2014)
Daniele Marsibilio, Andrea Sorbi
Singleton enumeration reducibility and arithmetic. J. Log. Comput. 23 (6) (2013)
Daniele Marsibilio, Andrea Sorbi
Bounded enumeration reducibility and its degree structure. Arch. Math. Log. 51 (1-2) (2012)
Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi
Empty intervals in the enumeration degrees. Ann. Pure Appl. Log. 163 (5) (2012)
Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi
Computability at Logic Colloquium 2009. J. Log. Comput. 22 (4) (2012)
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Math. Log. Q. 58 (4-5) (2012)
Claudio Marini, Giulia Simi, Andrea Sorbi, Marianna Sorrentino
A note on algebras of languages. Theor. Comput. Sci. 412 (46) (2011)
Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi
Immunity properties and strong positive reducibilities. Arch. Math. Log. 50 (3-4) (2011)
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50 (3-4) (2011)
Andrea Sorbi, Guohua Wu, Yue Yang
Diamond embeddings into the enumeration degrees. Math. Struct. Comput. Sci. 20 (5) (2010)
S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi
Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45 (4) (2009)
Andrew E. M. Lewis, André Nies, Andrea Sorbi
The First Order Theories of the Medvedev and Muchnik Lattices. CiE (2009)
S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Logic and Computation in the Real World: CiE 2007. J. Log. Comput. 19 (1) (2009)
F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi
Lattices of local two-dimensional languages. Theor. Comput. Sci. 410 (27-29) (2009)
Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Foreword. Theor. Comput. Sci. 410 (4-5) (2009)
Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
Preface. Ann. Pure Appl. Log. 160 (3) (2009)
Andrea Sorbi
Strong Positive Reducibilities. TAMC (2009)
Andrea Sorbi, Guohua Wu, Yue Yang
High Minimal Pairs in the Enumeration Degrees. TAMC (2009)
Maria L. Affatato, Thomas F. Kent, Andrea Sorbi
}-enumeration degrees: a new perspective. Arch. Math. Log. 47 (3) (2008)
Roland Sh. Omanadze, Andrea Sorbi
hyperhyperimmune sets. J. Symb. Log. 73 (4) (2008)
Andrea Sorbi, Sebastiaan Terwijn
Intermediate logics and factors of the Medvedev lattice. Ann. Pure Appl. Log. 155 (2) (2008)
Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong
Preface. Electron. Notes Theor. Comput. Sci. 202 (2008)
Thomas F. Kent, Andrea Sorbi
Bounding nonsplitting enumeration degrees. J. Symb. Log. 72 (4) (2007)
Roland Sh. Omanadze, Andrea Sorbi
Strong Enumeration Reducibilities. Arch. Math. Log. 45 (7) (2006)
Matthew Giorgi, Andrea Sorbi, Yue Yang
enumeration degrees and the high/low hierarchy. J. Symb. Log. 71 (4) (2006)
John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. J. Comput. Syst. Sci. 71 (3) (2005)
S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70 (3) (2005)
Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5 (2) (2005)
John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms. COLT (2003)
Steffen Lempp, Andrea Sorbi
Enumeration Degrees. J. Symb. Log. 67 (1) (2002)
Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi
Density results in the Delta20 e-degrees. Arch. Math. Log. 40 (8) (2001)
André Nies, Andrea Sorbi
Enumeration Degrees. J. Symb. Log. 65 (1) (2000)
Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi
e-Degrees. J. Symb. Log. 65 (1) (2000)
Andrea Sorbi
Sets of Generators and Automorphism Bases for the Enumeration Degrees. Ann. Pure Appl. Log. 94 (1-3) (1998)
S. Barry Cooper, Andrea Sorbi, Xiaoding Yi
Sets. Ann. Pure Appl. Log. 82 (3) (1996)
S. Barry Cooper, Andrea Sorbi
. J. Symb. Log. 61 (4) (1996)
Caterina Bianchini, Andrea Sorbi
A Note an Closed Degrees of Difficulty of the Medvedev Lattice. Math. Log. Q. 42 (1996)
Franco Montagna, Giulia Simi, Andrea Sorbi
Logic and probabilistic systems. Arch. Math. Log. 35 (4) (1996)
Andrea Sorbi, Sandra Fontani, Franco Montagna
A Note on Relative Efficiency of Axiom Systems. Math. Log. Q. 40 (1994)
Caterina Bianchini, Andrea Sorbi
Reducibility in Some Categories of Partial Recursive Operators. Math. Log. Q. 38 (1) (1992)
Andrea Sorbi
Embedding Brouwer Algebras in the Medvedev Lattice. Notre Dame J. Formal Log. 32 (2) (1991)
Andrea Sorbi
Some Quotient Lattices of the Medvedev Lattice. Math. Log. Q. 37 (9-12) (1991)
Andrea Sorbi
Some Remarks on the Algebraic Structure of the Medvedev Lattice. J. Symb. Log. 55 (2) (1990)
Andrea Sorbi
On some filters and ideals of the Medvedev lattice. Arch. Math. Log. 30 (1) (1990)
Franco Montagna, Andrea Sorbi
Creativeness and Completeness in Recursion Categories of Partial Recursive Operators. J. Symb. Log. 54 (3) (1989)
Franco Montagna, Andrea Sorbi
Universal Recursion Theoretic Properties of R.E. Preordered Structures. J. Symb. Log. 50 (2) (1985)
Claudio Bernardi, Andrea Sorbi
Classifying Positive Equivalence Relations. J. Symb. Log. 48 (3) (1983)