default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Sorbi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j71]Valentino Delle Rose
, Luca San Mauro, Andrea Sorbi:
Classifying word problems of finitely generated algebras via computable reducibility. Int. J. Algebra Comput. 33(4): 751-768 (2023)- [j70]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): 1060-1088 (2023) - 2022
- [j69]Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi:
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11(3-4): 187-221 (2022) - [j68]Uri Andrews, Andrea Sorbi:
Initial Segments of the Degrees of Ceers. J. Symb. Log. 87(3): 1260-1282 (2022) - 2021
- [j67]Duccio Pianigiani, Andrea Sorbi:
A note on uniform density in weak arithmetical theories. Arch. Math. Log. 60(1-2): 211-225 (2021) - [j66]Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Notes on conjunctive and Quasi degrees. J. Log. Comput. 31(5): 1317-1329 (2021) - [j65]Uri Andrews, Andrea Sorbi:
Effective Inseparability, Lattices, and Preordering Relations. Rev. Symb. Log. 14(4): 838-865 (2021) - [c7]Andrea Sorbi:
Effective Inseparability and Its Applications. CiE 2021: 417-423 - 2020
- [j64]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): 777-791 (2020) - [j63]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): 835-864 (2020) - [j62]Uri Andrews, Noah Schweber, Andrea Sorbi:
The theory of ceers computes true arithmetic. Ann. Pure Appl. Log. 171(8): 102811 (2020) - [j61]Uri Andrews, Noah Schweber, Andrea Sorbi:
Self-full ceers and the uniform join operator. J. Log. Comput. 30(3): 765-783 (2020) - [j60]Valentino Delle Rose, Luca San Mauro, Andrea Sorbi:
Word problems and ceers. Math. Log. Q. 66(3): 341-354 (2020)
2010 – 2019
- 2019
- [j59]Paul Shafer, Andrea Sorbi:
Comparing the degrees of enumerability and the closed Medvedev degrees. Arch. Math. Log. 58(5-6): 527-542 (2019) - [j58]Uri Andrews, Andrea Sorbi:
Joins and meets in the structure of ceers. Comput. 8(3-4): 193-241 (2019) - [j57]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
- [j56]Uri Andrews, Andrea Sorbi:
Jumps of computably enumerable equivalence relations. Ann. Pure Appl. Log. 169(3): 243-259 (2018) - [j55]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): 103-131 (2018) - [j54]André Nies, Andrea Sorbi:
Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28(3): 457-471 (2018) - 2017
- [c6]Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi:
A Survey on Universal Computably Enumerable Equivalence Relations. Computability and Complexity 2017: 418-451 - 2016
- [j53]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): 405-414 (2016) - [j52]Andrew Lewis-Pye, Andrea Sorbi:
In Memoriam: Barry Cooper 1943-2015. Bull. Symb. Log. 22(3): 361-365 (2016) - [j51]Hristo Ganchev, Andrea Sorbi:
Initial Segments Of The Σ20 Enumeration Degrees. J. Symb. Log. 81(1): 316-325 (2016) - [j50]Uri Andrews, Andrea Sorbi:
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations. J. Symb. Log. 81(4): 1375-1395 (2016) - [j49]Serikzhan A. Badaev, Andrea Sorbi:
Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62(1-2): 111-127 (2016) - [j48]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): 299-324 (2016) - [j47]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): 810-835 (2016) - 2015
- [j46]Serikzhan A. Badaev, Manat Mustafa, Andrea Sorbi:
Friedberg numberings in the Ershov hierarchy. Arch. Math. Log. 54(1-2): 59-73 (2015) - [j45]Franco Montagna, Giulia Simi, Andrea Sorbi:
Taking the Pirahã seriously. Commun. Nonlinear Sci. Numer. Simul. 21(1-3): 52-69 (2015) - [j44]Andrea Sorbi, Sebastiaan A. Terwijn:
Generalizations of the Weak Law of the Excluded Middle. Notre Dame J. Formal Log. 56(2): 321-331 (2015) - 2014
- [j43]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) - [j42]Theodore A. Slaman, Andrea Sorbi:
A note on initial Segments of the Enumeration Degrees. J. Symb. Log. 79(2): 633-643 (2014) - 2013
- [j41]Daniele Marsibilio, Andrea Sorbi:
Singleton enumeration reducibility and arithmetic. J. Log. Comput. 23(6): 1267-1292 (2013) - 2012
- [j40]Daniele Marsibilio, Andrea Sorbi:
Bounded enumeration reducibility and its degree structure. Arch. Math. Log. 51(1-2): 163-186 (2012) - [j39]Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi:
Empty intervals in the enumeration degrees. Ann. Pure Appl. Log. 163(5): 567-574 (2012) - [j38]Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi:
Computability at Logic Colloquium 2009. J. Log. Comput. 22(4): 667 (2012) - [j37]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): 366-376 (2012) - 2011
- [j36]Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi:
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50(3-4): 319-340 (2011) - [j35]Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Immunity properties and strong positive reducibilities. Arch. Math. Log. 50(3-4): 341-352 (2011) - [j34]Claudio Marini, Giulia Simi, Andrea Sorbi, Marianna Sorrentino:
A note on algebras of languages. Theor. Comput. Sci. 412(46): 6531-6536 (2011) - 2010
- [j33]Andrea Sorbi, Guohua Wu, Yue Yang:
Diamond embeddings into the enumeration degrees. Math. Struct. Comput. Sci. 20(5): 799-811 (2010)
2000 – 2009
- 2009
- [j32]Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Preface. Ann. Pure Appl. Log. 160(3): 229-230 (2009) - [j31]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Logic and Computation in the Real World: CiE 2007. J. Log. Comput. 19(1): 1-2 (2009) - [j30]S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi:
Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45(4): 647-649 (2009) - [j29]Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Foreword. Theor. Comput. Sci. 410(4-5): 283-284 (2009) - [j28]F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi:
Lattices of local two-dimensional languages. Theor. Comput. Sci. 410(27-29): 2701-2713 (2009) - [c5]Andrew E. M. Lewis, André Nies, Andrea Sorbi:
The First Order Theories of the Medvedev and Muchnik Lattices. CiE 2009: 324-331 - [c4]Andrea Sorbi:
Strong Positive Reducibilities. TAMC 2009: 29-38 - [c3]Andrea Sorbi, Guohua Wu, Yue Yang:
High Minimal Pairs in the Enumeration Degrees. TAMC 2009: 335-344 - 2008
- [j27]Maria L. Affatato, Thomas F. Kent, Andrea Sorbi:
Branching in the S02{Sigma02}-enumeration degrees: a new perspective. Arch. Math. Log. 47(3): 221-231 (2008) - [j26]Andrea Sorbi, Sebastiaan Terwijn:
Intermediate logics and factors of the Medvedev lattice. Ann. Pure Appl. Log. 155(2): 69-85 (2008) - [j25]Roland Sh. Omanadze, Andrea Sorbi:
A characterization of the Delta02 hyperhyperimmune sets. J. Symb. Log. 73(4): 1407-1415 (2008) - [e2]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, CCA 2007, Siena, Italy, June 16-18, 2007. Electronic Notes in Theoretical Computer Science 202, Elsevier 2008 [contents] - 2007
- [j24]Thomas F. Kent, Andrea Sorbi:
Bounding nonsplitting enumeration degrees. J. Symb. Log. 72(4): 1405-1417 (2007) - [c2]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong:
Preface. CCA 2007: 1-2 - [e1]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi:
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings. Lecture Notes in Computer Science 4497, Springer 2007, ISBN 978-3-540-73000-2 [contents] - 2006
- [j23]Roland Sh. Omanadze, Andrea Sorbi:
Strong Enumeration Reducibilities. Arch. Math. Log. 45(7): 869-912 (2006) - [j22]Matthew Giorgi, Andrea Sorbi, Yue Yang:
Properly Σ02 enumeration degrees and the high/low hierarchy. J. Symb. Log. 71(4): 1125-1144 (2006) - 2005
- [j21]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): 308-332 (2005) - [j20]Steffen Lempp, Theodore A. Slaman, Andrea Sorbi:
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5(2) (2005) - [j19]S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang:
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70(3): 741-766 (2005) - 2003
- [c1]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: 699-713 - 2002
- [j18]Steffen Lempp, Andrea Sorbi:
Embedding Finite Lattices into the Sigma02 Enumeration Degrees. J. Symb. Log. 67(1): 69-90 (2002) - 2001
- [j17]Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi:
Density results in the Delta20 e-degrees. Arch. Math. Log. 40(8): 597-614 (2001) - 2000
- [j16]Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi:
The Distribution of Properly Sigma02 e-Degrees. J. Symb. Log. 65(1): 19-32 (2000) - [j15]André Nies, Andrea Sorbi:
Structural Properties and Sigma02 Enumeration Degrees. J. Symb. Log. 65(1): 285-292 (2000)
1990 – 1999
- 1998
- [j14]Andrea Sorbi:
Sets of Generators and Automorphism Bases for the Enumeration Degrees. Ann. Pure Appl. Log. 94(1-3): 263-272 (1998) - 1996
- [j13]Franco Montagna, Giulia Simi, Andrea Sorbi:
Logic and probabilistic systems. Arch. Math. Log. 35(4): 225-261 (1996) - [j12]S. Barry Cooper, Andrea Sorbi, Xiaoding Yi:
Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. Ann. Pure Appl. Log. 82(3): 317-342 (1996) - [j11]S. Barry Cooper, Andrea Sorbi:
Noncappable Enumeration Degrees Below 0'e. J. Symb. Log. 61(4): 1347-1363 (1996) - [j10]Caterina Bianchini, Andrea Sorbi:
A Note an Closed Degrees of Difficulty of the Medvedev Lattice. Math. Log. Q. 42: 127-133 (1996) - 1994
- [j9]Andrea Sorbi, Sandra Fontani, Franco Montagna:
A Note on Relative Efficiency of Axiom Systems. Math. Log. Q. 40: 261-272 (1994) - 1992
- [j8]Caterina Bianchini, Andrea Sorbi:
Reducibility in Some Categories of Partial Recursive Operators. Math. Log. Q. 38(1): 349-359 (1992) - 1991
- [j7]Andrea Sorbi:
Some Quotient Lattices of the Medvedev Lattice. Math. Log. Q. 37(9-12): 167-182 (1991) - [j6]Andrea Sorbi:
Embedding Brouwer Algebras in the Medvedev Lattice. Notre Dame J. Formal Log. 32(2): 266-275 (1991) - 1990
- [j5]Andrea Sorbi:
On some filters and ideals of the Medvedev lattice. Arch. Math. Log. 30(1): 29-48 (1990) - [j4]Andrea Sorbi:
Some Remarks on the Algebraic Structure of the Medvedev Lattice. J. Symb. Log. 55(2): 831-853 (1990)
1980 – 1989
- 1989
- [j3]Franco Montagna, Andrea Sorbi:
Creativeness and Completeness in Recursion Categories of Partial Recursive Operators. J. Symb. Log. 54(3): 1023-1041 (1989) - 1985
- [j2]Franco Montagna, Andrea Sorbi:
Universal Recursion Theoretic Properties of R.E. Preordered Structures. J. Symb. Log. 50(2): 397-406 (1985) - 1983
- [j1]Claudio Bernardi, Andrea Sorbi:
Classifying Positive Equivalence Relations. J. Symb. Log. 48(3): 529-538 (1983)
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-04-24 23:21 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:
