Andrea Sorbi

According to our database, Andrea Sorbi authored at least 77 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities.

Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang

J. Log. Comput., July, 2023

Classifying word problems of finitely generated algebras via computable reducibility.

Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

Int. J. Algebra Comput., June, 2023

2022

Initial Segments of the Degrees of Ceers.

Uri Andrews, Andrea Sorbi

J. Symb. Log., 2022

Primitive recursive equivalence relations and their primitive recursive complexity.

Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

Comput., 2022

2021

Effective Inseparability, Lattices, and Preordering Relations.

Uri Andrews, Andrea Sorbi

Rev. Symb. Log., 2021

Notes on conjunctive and Quasi degrees.

Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi

J. Log. Comput., 2021

A note on uniform density in weak arithmetical theories.

Duccio Pianigiani, Andrea Sorbi

Arch. Math. Log., 2021

Effective Inseparability and Its Applications.

Andrea Sorbi

Proceedings of the Connecting with Computability, 2021

2020

Word problems and ceers.

Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

Math. Log. Q., 2020

Self-full ceers and the uniform join operator.

Uri Andrews, Noah Schweber, Andrea Sorbi

J. Log. Comput., 2020

The theory of ceers computes true arithmetic.

Uri Andrews, Noah Schweber, Andrea Sorbi

Ann. Pure Appl. Log., 2020

Incomparability in local structures of s-degrees and Q-degrees.

Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang

Arch. Math. Log., 2020

Classifying equivalence relations in the Ershov hierarchy.

Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev

Arch. Math. Log., 2020

2019

Trial and error mathematics: Dialectical systems and completions of theories.

Jacopo Amidei, Uri Andrews, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi

J. Log. Comput., 2019

Joins and meets in the structure of ceers.

Uri Andrews, Andrea Sorbi

Comput., 2019

Comparing the degrees of enumerability and the closed Medvedev degrees.

Paul Shafer, Andrea Sorbi

Arch. Math. Log., 2019

2018

Calibrating word problems of groups via the complexity of equivalence relations.

André Nies, Andrea Sorbi

Math. Struct. Comput. Sci., 2018

S. Barry Cooper (1943-2015).

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

Comput., 2018

Jumps of computably enumerable equivalence relations.

Uri Andrews, Andrea Sorbi

Ann. Pure Appl. Log., 2018

2017

A Survey on Universal Computably Enumerable Equivalence Relations.

Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi

Proceedings of the Computability and Complexity, 2017

2016

Trial and error Mathematics I: Dialectical and Quasidialectical Systems.

Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi, Andrea Sorbi

Rev. Symb. Log., 2016

Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets.

Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi

Rev. Symb. Log., 2016

Weakly precomplete computably enumerable equivalence relations.

Serikzhan A. Badaev, Andrea Sorbi

Math. Log. Q., 2016

Initial Segments Of The Σ₂⁰ Enumeration Degrees.

Hristo Ganchev, Andrea Sorbi

J. Symb. Log., 2016

The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations.

Uri Andrews, Andrea Sorbi

J. Symb. Log., 2016

In Memoriam: Barry Cooper 1943-2015.

Andrew Lewis-Pye, Andrea Sorbi

Bull. Symb. Log., 2016

A note on the enumeration degrees of 1-generic sets.

Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent, Andrea Sorbi

Arch. Math. Log., 2016

2015

Generalizations of the Weak Law of the Excluded Middle.

Andrea Sorbi, Sebastiaan A. Terwijn

Notre Dame J. Formal Log., 2015

Taking the Pirahã seriously.

Franco Montagna, Giulia Simi, Andrea Sorbi

Commun. Nonlinear Sci. Numer. Simul., 2015

Friedberg numberings in the Ershov hierarchy.

Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi

Arch. Math. Log., 2015

2014

A note on initial Segments of the Enumeration Degrees.

Theodore A. Slaman, Andrea Sorbi

J. Symb. Log., 2014

Universal computably Enumerable Equivalence Relations.

Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

J. Symb. Log., 2014

2013

Singleton enumeration reducibility and arithmetic.

Daniele Marsibilio, Andrea Sorbi

J. Log. Comput., 2013

2012

Rogers semilattices of families of two embedded sets in the Ershov hierarchy.

Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi

Math. Log. Q., 2012

Computability at Logic Colloquium 2009.

Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi

J. Log. Comput., 2012

Empty intervals in the enumeration degrees.

Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi

Ann. Pure Appl. Log., 2012

Bounded enumeration reducibility and its degree structure.

Daniele Marsibilio, Andrea Sorbi

Arch. Math. Log., 2012

2011

A note on algebras of languages.

Claudio Marini, Giulia Simi, Andrea Sorbi, Marianna Sorrentino

Theor. Comput. Sci., 2011

Topological aspects of the Medvedev lattice.

Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi

Arch. Math. Log., 2011

Immunity properties and strong positive reducibilities.

Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi

Arch. Math. Log., 2011

2010

Diamond embeddings into the enumeration degrees.

Andrea Sorbi, Guohua Wu, Yue Yang

Math. Struct. Comput. Sci., 2010

2009

Lattices of local two-dimensional languages.

F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi

Theor. Comput. Sci., 2009

Foreword.

Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi

Theor. Comput. Sci., 2009

Computation and Logic in the Real World: CiE 2007.

S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi

Theory Comput. Syst., 2009

Logic and Computation in the Real World: CiE 2007.

S. Barry Cooper, Benedikt Löwe, Andrea Sorbi

J. Log. Comput., 2009

Preface.

Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi

Ann. Pure Appl. Log., 2009

High Minimal Pairs in the Enumeration Degrees.

Andrea Sorbi, Guohua Wu, Yue Yang

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Strong Positive Reducibilities.

Andrea Sorbi

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

The First Order Theories of the Medvedev and Muchnik Lattices.

Andrew E. M. Lewis, André Nies, Andrea Sorbi

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

A characterization of the Delta⁰₂ hyperhyperimmune sets.

Roland Sh. Omanadze, Andrea Sorbi

J. Symb. Log., 2008

Intermediate logics and factors of the Medvedev lattice.

Andrea Sorbi, Sebastiaan Terwijn

Ann. Pure Appl. Log., 2008

Branching in the S⁰₂{Sigma⁰₂}-enumeration degrees: a new perspective.

Maria L. Affatato, Thomas F. Kent, Andrea Sorbi

Arch. Math. Log., 2008

2007

Bounding nonsplitting enumeration degrees.

Thomas F. Kent, Andrea Sorbi

J. Symb. Log., 2007

Preface.

Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2006

Properly Σ⁰₂ enumeration degrees and the high/low hierarchy.

Matthew Giorgi, Andrea Sorbi, Yue Yang

J. Symb. Log., 2006

Strong Enumeration Reducibilities.

Roland Sh. Omanadze, Andrea Sorbi

Arch. Math. Log., 2006

2005

Bounding and nonbounding minimal pairs in the enumeration degrees.

S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang

J. Symb. Log., 2005

On Extensions of Embeddings into the Enumeration Degrees of the -Sets.

Steffen Lempp, Theodore A. Slaman, Andrea Sorbi

J. Math. Log., 2005

On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms.

John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi

J. Comput. Syst. Sci., 2005

2002

Embedding Finite Lattices into the Sigma⁰₂ Enumeration Degrees.

Steffen Lempp, Andrea Sorbi

J. Symb. Log., 2002

2001

Density results in the Delta20 e-degrees.

Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi

Arch. Math. Log., 2001

2000

Structural Properties and Sigma⁰₂ Enumeration Degrees.

André Nies, Andrea Sorbi

J. Symb. Log., 2000

The Distribution of Properly Sigma⁰₂ e-Degrees.

Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi

J. Symb. Log., 2000

1998

Sets of Generators and Automorphism Bases for the Enumeration Degrees.

Andrea Sorbi

Ann. Pure Appl. Log., 1998

1996

A Note an Closed Degrees of Difficulty of the Medvedev Lattice.

Caterina Bianchini, Andrea Sorbi

Math. Log. Q., 1996

Noncappable Enumeration Degrees Below 0'_e.

S. Barry Cooper, Andrea Sorbi

J. Symb. Log., 1996

Cupping and Noncupping in the Enumeration Degrees of Sigma₂⁰ Sets.

S. Barry Cooper, Andrea Sorbi, Xiaoding Yi

Ann. Pure Appl. Log., 1996

Logic and probabilistic systems.

Franco Montagna, Giulia Simi, Andrea Sorbi

Arch. Math. Log., 1996

1994

A Note on Relative Efficiency of Axiom Systems.

Andrea Sorbi, Sandra Fontani, Franco Montagna

Math. Log. Q., 1994

1992

Reducibility in Some Categories of Partial Recursive Operators.

Caterina Bianchini, Andrea Sorbi

Math. Log. Q., 1992

1991

Embedding Brouwer Algebras in the Medvedev Lattice.

Andrea Sorbi

Notre Dame J. Formal Log., 1991

Some Quotient Lattices of the Medvedev Lattice.

Andrea Sorbi

Math. Log. Q., 1991

1990

Some Remarks on the Algebraic Structure of the Medvedev Lattice.

Andrea Sorbi

J. Symb. Log., 1990

On some filters and ideals of the Medvedev lattice.

Andrea Sorbi

Arch. Math. Log., 1990

1989

Creativeness and Completeness in Recursion Categories of Partial Recursive Operators.

Franco Montagna, Andrea Sorbi

J. Symb. Log., 1989

1985

Universal Recursion Theoretic Properties of R.E. Preordered Structures.

Franco Montagna, Andrea Sorbi

J. Symb. Log., 1985

1983

Classifying Positive Equivalence Relations.

Claudio Bernardi, Andrea Sorbi

J. Symb. Log., 1983