Andrea Sorbi

83 papers A* 1C 7Journal 74Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Conjunctive degrees and cylinders.
J. Log. Comput.
Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi
2025 J jnl
On the transversals of a ceer.
Comput.
Irakli O. Chitaia, Valentino Delle Rose, Andrea Sorbi
2025 J jnl
The singleton degrees of the Σ20 sets are not dense.
Ann. Pure Appl. Log.
Thomas F. Kent, Keng Meng Ng, Andrea Sorbi
2023 J jnl
Classifying word problems of finitely generated algebras via computable reducibility.
Int. J. Algebra Comput.
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
2023 J jnl
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities.
J. Log. Comput.
Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
2022 J jnl
Initial Segments of the Degrees of Ceers.
J. Symb. Log.
Uri Andrews, Andrea Sorbi
2022 J jnl
Primitive recursive equivalence relations and their primitive recursive complexity.
Comput.
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
2021 J jnl
A note on uniform density in weak arithmetical theories.
Arch. Math. Log.
Duccio Pianigiani, Andrea Sorbi
2021 C conf
Effective Inseparability and Its Applications.
CiE
Andrea Sorbi
2021 J jnl
Effective Inseparability, Lattices, and Preordering Relations.
Rev. Symb. Log.
Uri Andrews, Andrea Sorbi
2021 J jnl
Notes on conjunctive and Quasi degrees.
J. Log. Comput.
Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi
2020 J jnl
Classifying equivalence relations in the Ershov hierarchy.
Arch. Math. Log.
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev
2020 J jnl
Incomparability in local structures of s-degrees and Q-degrees.
Arch. Math. Log.
Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
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
2020 J jnl
Word problems and ceers.
Math. Log. Q.
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
2019 J jnl
Comparing the degrees of enumerability and the closed Medvedev degrees.
Arch. Math. Log.
Paul Shafer, Andrea Sorbi
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
Calibrating word problems of groups via the complexity of equivalence relations.
Math. Struct. Comput. Sci.
André Nies, Andrea Sorbi
2018 J jnl
Jumps of computably enumerable equivalence relations.
Ann. Pure Appl. Log.
Uri Andrews, Andrea Sorbi
2018 J jnl
S. Barry Cooper (1943-2015).
Comput.
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
2017 — conf
A Survey on Universal Computably Enumerable Equivalence Relations.
Computability and Complexity
Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi
2016 J jnl
A note on the enumeration degrees of 1-generic sets.
Arch. Math. Log.
Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent, Andrea Sorbi
2016 J jnl
In Memoriam: Barry Cooper 1943-2015.
Bull. Symb. Log.
Andrew Lewis-Pye, Andrea Sorbi
2016 J jnl
Initial Segments Of The Σ
J. Symb. Log.
Hristo Ganchev, Andrea Sorbi
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
Trial and error Mathematics I: Dialectical and Quasidialectical Systems.
Rev. Symb. Log.
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi, Andrea Sorbi
2016 J jnl
Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets.
Rev. Symb. Log.
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
2016 J jnl
Weakly precomplete computably enumerable equivalence relations.
Math. Log. Q.
Serikzhan A. Badaev, Andrea Sorbi
2015 J jnl
Friedberg numberings in the Ershov hierarchy.
Arch. Math. Log.
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
2015 J jnl
Generalizations of the Weak Law of the Excluded Middle.
Notre Dame J. Formal Log.
Andrea Sorbi, Sebastiaan A. Terwijn
2015 J jnl
Taking the Pirahã seriously.
Commun. Nonlinear Sci. Numer. Simul.
Franco Montagna, Giulia Simi, Andrea Sorbi
2014 J jnl
A note on initial Segments of the Enumeration Degrees.
J. Symb. Log.
Theodore A. Slaman, Andrea Sorbi
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
Singleton enumeration reducibility and arithmetic.
J. Log. Comput.
Daniele Marsibilio, Andrea Sorbi
2012 J jnl
Bounded enumeration reducibility and its degree structure.
Arch. Math. Log.
Daniele Marsibilio, Andrea Sorbi
2012 J jnl
Computability at Logic Colloquium 2009.
J. Log. Comput.
Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi
2012 J jnl
Empty intervals in the enumeration degrees.
Ann. Pure Appl. Log.
Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi
2012 J jnl
Rogers semilattices of families of two embedded sets in the Ershov hierarchy.
Math. Log. Q.
Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi
2011 J jnl
A note on algebras of languages.
Theor. Comput. Sci.
Claudio Marini, Giulia Simi, Andrea Sorbi, Marianna Sorrentino
2011 J jnl
Immunity properties and strong positive reducibilities.
Arch. Math. Log.
Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi
2011 J jnl
Topological aspects of the Medvedev lattice.
Arch. Math. Log.
Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi
2010 J jnl
Diamond embeddings into the enumeration degrees.
Math. Struct. Comput. Sci.
Andrea Sorbi, Guohua Wu, Yue Yang
2009 J jnl
Computation and Logic in the Real World: CiE 2007.
Theory Comput. Syst.
S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi
2009 J jnl
Foreword.
Theor. Comput. Sci.
Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
2009 C conf
High Minimal Pairs in the Enumeration Degrees.
TAMC
Andrea Sorbi, Guohua Wu, Yue Yang
2009 J jnl
Lattices of local two-dimensional languages.
Theor. Comput. Sci.
F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi
2009 J jnl
Logic and Computation in the Real World: CiE 2007.
J. Log. Comput.
S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
2009 J jnl
Preface.
Ann. Pure Appl. Log.
Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
2009 C conf
Strong Positive Reducibilities.
TAMC
Andrea Sorbi
2009 C conf
The First Order Theories of the Medvedev and Muchnik Lattices.
CiE
Andrew E. M. Lewis, André Nies, Andrea Sorbi
2008 J jnl
A characterization of the Delta
J. Symb. Log.
Roland Sh. Omanadze, Andrea Sorbi
2008 J jnl
Branching in the S
Arch. Math. Log.
Maria L. Affatato, Thomas F. Kent, Andrea Sorbi
2008 J jnl
Intermediate logics and factors of the Medvedev lattice.
Ann. Pure Appl. Log.
Andrea Sorbi, Sebastiaan Terwijn
2008 C ed.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007
CCA
Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong
2007 J jnl
Bounding nonsplitting enumeration degrees.
J. Symb. Log.
Thomas F. Kent, Andrea Sorbi
2007 C ed.
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
CiE
S. Barry Cooper, Benedikt Löwe, Andrea Sorbi
2007 C conf
Preface.
CCA
Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong
2006 J jnl
Properly Σ
J. Symb. Log.
Matthew Giorgi, Andrea Sorbi, Yue Yang
2006 J jnl
Strong Enumeration Reducibilities.
Arch. Math. Log.
Roland Sh. Omanadze, Andrea Sorbi
2005 J jnl
Bounding and nonbounding minimal pairs in the enumeration degrees.
J. Symb. Log.
S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang
2005 J jnl
On Extensions of Embeddings into the Enumeration Degrees of the -Sets.
J. Math. Log.
Steffen Lempp, Theodore A. Slaman, Andrea Sorbi
2005 J jnl
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms.
J. Comput. Syst. Sci.
John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
2003 A* conf
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms.
COLT
John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
2002 J jnl
Embedding Finite Lattices into the Sigma
J. Symb. Log.
Steffen Lempp, Andrea Sorbi
2001 J jnl
Density results in the Delta20 e-degrees.
Arch. Math. Log.
Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi
2000 J jnl
Structural Properties and Sigma
J. Symb. Log.
André Nies, Andrea Sorbi
2000 J jnl
The Distribution of Properly Sigma
J. Symb. Log.
Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi
1998 J jnl
Sets of Generators and Automorphism Bases for the Enumeration Degrees.
Ann. Pure Appl. Log.
Andrea Sorbi
1996 J jnl
A Note an Closed Degrees of Difficulty of the Medvedev Lattice.
Math. Log. Q.
Caterina Bianchini, Andrea Sorbi
1996 J jnl
Cupping and Noncupping in the Enumeration Degrees of Sigma
Ann. Pure Appl. Log.
S. Barry Cooper, Andrea Sorbi, Xiaoding Yi
1996 J jnl
Logic and probabilistic systems.
Arch. Math. Log.
Franco Montagna, Giulia Simi, Andrea Sorbi
1996 J jnl
Noncappable Enumeration Degrees Below 0'
J. Symb. Log.
S. Barry Cooper, Andrea Sorbi
1994 J jnl
A Note on Relative Efficiency of Axiom Systems.
Math. Log. Q.
Andrea Sorbi, Sandra Fontani, Franco Montagna
1992 J jnl
Reducibility in Some Categories of Partial Recursive Operators.
Math. Log. Q.
Caterina Bianchini, Andrea Sorbi
1991 J jnl
Embedding Brouwer Algebras in the Medvedev Lattice.
Notre Dame J. Formal Log.
Andrea Sorbi
1991 J jnl
Some Quotient Lattices of the Medvedev Lattice.
Math. Log. Q.
Andrea Sorbi
1990 J jnl
On some filters and ideals of the Medvedev lattice.
Arch. Math. Log.
Andrea Sorbi
1990 J jnl
Some Remarks on the Algebraic Structure of the Medvedev Lattice.
J. Symb. Log.
Andrea Sorbi
1989 J jnl
Creativeness and Completeness in Recursion Categories of Partial Recursive Operators.
J. Symb. Log.
Franco Montagna, Andrea Sorbi
1985 J jnl
Universal Recursion Theoretic Properties of R.E. Preordered Structures.
J. Symb. Log.
Franco Montagna, Andrea Sorbi
1983 J jnl
Classifying Positive Equivalence Relations.
J. Symb. Log.
Claudio Bernardi, Andrea Sorbi