Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrea Sorbi
2010 – today
- 2012
[j37]Daniele Marsibilio, Andrea Sorbi: Bounded enumeration reducibility and its degree structure. Arch. Math. Log. 51(1-2): 163-186 (2012)- [j36]Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi: Empty intervals in the enumeration degrees. Ann. Pure Appl. Logic 163(5): 567-574 (2012)
- [j35]Alexandra Soskova, S. Barry Cooper, Andrea Sorbi: Computability at Logic Colloquium 2009. J. Log. Comput. 22(4): 667 (2012)
- [j34]Serikzhan A. Badaev, Mustafa Manat, Andrea Sorbi: Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Math. Log. Q. 58(4-5): 366-376 (2012)
- 2011
- [j33]Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi: Topological aspects of the Medvedev lattice. Arch. Math. Log. 50(3-4): 319-340 (2011)
- [j32]Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi: Immunity properties and strong positive reducibilities. Arch. Math. Log. 50(3-4): 341-352 (2011)
- [j31]Claudio Marini, Giulia Simi, Andrea Sorbi, Marianna Sorrentino: A note on algebras of languages. Theor. Comput. Sci. 412(46): 6531-6536 (2011)
- 2010
- [j30]Andrea Sorbi, Guohua Wu, Yue Yang: Diamond embeddings into the enumeration degrees. Mathematical Structures in Computer Science 20(5): 799-811 (2010)
2000 – 2009
- 2009
- [j29]Samuel R. Buss, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi: Preface. Ann. Pure Appl. Logic 160(3): 229-230 (2009)
- [j28]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)
- [j27]S. Barry Cooper, Elvira Mayordomo, Andrea Sorbi: Computation and Logic in the Real World: CiE 2007. Theory Comput. Syst. 45(4): 647-649 (2009)
- [j26]Paola Bonizzoni, S. Barry Cooper, Benedikt Löwe, Andrea Sorbi: Foreword. Theor. Comput. Sci. 410(4-5): 283-284 (2009)
- [j25]F. De Carli, Andrea Frosini, Simone Rinaldi, Andrea Sorbi: Lattices of local two-dimensional languages. Theor. Comput. Sci. 410(27-29): 2701-2713 (2009)
- [c4]Andrew E. M. Lewis, André Nies, Andrea Sorbi: The First Order Theories of the Medvedev and Muchnik Lattices. CiE 2009: 324-331
- [c3]
- [c2]
- 2008
- [j24]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)
- [j23]Andrea Sorbi, Sebastiaan Terwijn: Intermediate logics and factors of the Medvedev lattice. Ann. Pure Appl. Logic 155(2): 69-85 (2008)
- [j22]Ruth Dillhage, Tanja Grubba, Andrea Sorbi, Klaus Weihrauch, Ning Zhong: Preface. Electr. Notes Theor. Comput. Sci. 202: 1-2 (2008)
- [j21]Roland Sh. Omanadze, Andrea Sorbi: A characterization of the Delta02 hyperhyperimmune sets. J. Symb. Log. 73(4): 1407-1415 (2008)
- 2007
- [j20]Thomas F. Kent, Andrea Sorbi: Bounding nonsplitting enumeration degrees. J. Symb. Log. 72(4): 1405-1417 (2007)
- [e1]S. Barry Cooper, Benedikt Löwe, Andrea Sorbi (Eds.): 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
- 2006
- [j19]Roland Sh. Omanadze, Andrea Sorbi: Strong Enumeration Reducibilities. Arch. Math. Log. 45(7): 869-912 (2006)
- [j18]Matthew Giorgi, Andrea Sorbi, Yue Yang: Properly Sigma02 enumeration degrees and the high/low hierarchy. J. Symb. Log. 71(4): 1125-1144 (2006)
- 2005
- [j17]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)
- [j16]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
- [j15]Steffen Lempp, Andrea Sorbi: Embedding Finite Lattices into the Sigma02 Enumeration Degrees. J. Symb. Log. 67(1): 69-90 (2002)
- 2001
- [j14]Marat M. Arslanov, Iskander Sh. Kalimullin, Andrea Sorbi: Density results in the Delta20 e-degrees. Arch. Math. Log. 40(8): 597-614 (2001)
- 2000
- [j13]Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi: The Distribution of Properly Sigma02 e-Degrees. J. Symb. Log. 65(1): 19-32 (2000)
- [j12]André Nies, Andrea Sorbi: Structural Properties and Sigma02 Enumeration Degrees. J. Symb. Log. 65(1): 285-292 (2000)
1990 – 1999
- 1998
- [j11]Andrea Sorbi: Sets of Generators and Automorphism Bases for the Enumeration Degrees. Ann. Pure Appl. Logic 94(1-3): 263-272 (1998)
- 1996
- [j10]Franco Montagna, Giulia Simi, Andrea Sorbi: Logic and probabilistic systems. Arch. Math. Log. 35(4): 225-261 (1996)
- [j9]S. Barry Cooper, Andrea Sorbi, Xiaoding Yi: Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. Ann. Pure Appl. Logic 82(3): 317-342 (1996)
- [j8]S. Barry Cooper, Andrea Sorbi: Noncappable Enumeration Degrees Below 0'e. J. Symb. Log. 61(4): 1347-1363 (1996)
- [j7]Caterina Bianchini, Andrea Sorbi: A Note an Closed Degrees of Difculty of the Medvedev Lattice. Math. Log. Q. 42: 127-133 (1996)
- 1994
- [j6]Andrea Sorbi, Sandra Fontani, Franco Montagna: A Note on Relative Efficiency of Axiom Systems. Math. Log. Q. 40: 261-272 (1994)
- 1991
- [j5]Andrea Sorbi: Embedding Brouwer Algebras in the Medvedev Lattice. Notre Dame Journal of Formal Logic 32(2): 266-275 (1991)
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:21 CET by the dblp team