Search the dblp DataBase

Publications of Author

1. John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
   On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms. [Citation Graph (0, 0)][DBLP]
   COLT, 2003, pp:699-713 [Conf]
   
2. Roland Sh. Omanadze, Andrea Sorbi
   Strong Enumeration Reducibilities. [Citation Graph (0, 0)][DBLP]
   Arch. Math. Log., 2006, v:45, n:7, pp:869-912 [Journal]
   
3. S. Barry Cooper, Andrea Sorbi, Xiaoding Yi
   Cupping and Noncupping in the Enumeration Degrees of Sigma₂⁰ Sets. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1996, v:82, n:3, pp:317-342 [Journal]
   
4. Andrea Sorbi
   Sets of Generators and Automorphism Bases for the Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:263-272 [Journal]
   
5. John Case, Sanjay Jain, Franco Montagna, Giulia Simi, Andrea Sorbi
   On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2005, v:71, n:3, pp:308-332 [Journal]
   
6. Stanislaw Bereznyuk, Richard Coles, Andrea Sorbi
   The Distribution of Properly Sigma⁰₂ e-Degrees. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 2000, v:65, n:1, pp:19-32 [Journal]
   
7. Claudio Bernardi, Andrea Sorbi
   Classifying Positive Equivalence Relations. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1983, v:48, n:3, pp:529-538 [Journal]
   
8. S. Barry Cooper, Andrea Sorbi
   Noncappable Enumeration Degrees Below 0'_e. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1996, v:61, n:4, pp:1347-1363 [Journal]
   
9. Steffen Lempp, Andrea Sorbi
   Embedding Finite Lattices into the Sigma⁰₂ Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 2002, v:67, n:1, pp:69-90 [Journal]
   
10. Franco Montagna, Andrea Sorbi
    Universal Recursion Theoretic Properties of R.E. Preordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:2, pp:397-406 [Journal]
    
11. Franco Montagna, Andrea Sorbi
    Creativeness and Completeness in Recursion Categories of Partial Recursive Operators. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:1023-1041 [Journal]
    
12. André Nies, Andrea Sorbi
    Structural Properties and Sigma⁰₂ Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:1, pp:285-292 [Journal]
    
13. Andrea Sorbi
    Some Remarks on the Algebraic Structure of the Medvedev Lattice. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:2, pp:831-853 [Journal]
    
14. Caterina Bianchini, Andrea Sorbi
    A Note an Closed Degrees of Difculty of the Medvedev Lattice. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:127-133 [Journal]
    
15. Andrea Sorbi, Sandra Fontani, Franco Montagna
    A Note on Relative Efficiency of Axiom Systems. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:261-272 [Journal]
    
16. Andrea Sorbi
    Embedding Brouwer Algebras in the Medvedev Lattice. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1991, v:32, n:2, pp:266-275 [Journal]
    
17. 
    The First Order Theories of the Medvedev and Muchnik Lattices. [Citation Graph (, )][DBLP]
    
    
18. 
    Strong Positive Reducibilities. [Citation Graph (, )][DBLP]
    
    
19. 
    High Minimal Pairs in the Enumeration Degrees. [Citation Graph (, )][DBLP]
    
    
20. 
    Density results in the Delta20 e-degrees. [Citation Graph (, )][DBLP]
    
    
21. 
    Branching in the S⁰₂{Sigma⁰₂}-enumeration degrees: a new perspective. [Citation Graph (, )][DBLP]
    
    
22. 
    Intermediate logics and factors of the Medvedev lattice. [Citation Graph (, )][DBLP]
    
    
23. 
    Preface. [Citation Graph (, )][DBLP]
    
    
24. 
    Preface. [Citation Graph (, )][DBLP]