2009 |
22 | EE | Paola Bonizzoni,
S. Barry Cooper,
Benedikt Löwe,
Andrea Sorbi:
Foreword.
Theor. Comput. Sci. 410(4-5): 283-284 (2009) |
2008 |
21 | EE | Andrea Sorbi,
Sebastiaan Terwijn:
Intermediate logics and factors of the Medvedev lattice.
Ann. Pure Appl. Logic 155(2): 69-85 (2008) |
20 | EE | 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) |
19 | EE | Ruth Dillhage,
Tanja Grubba,
Andrea Sorbi,
Klaus Weihrauch,
Ning Zhong:
Preface.
Electr. Notes Theor. Comput. Sci. 202: 1-2 (2008) |
2007 |
18 | | 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
Springer 2007 |
2006 |
17 | EE | Roland Sh. Omanadze,
Andrea Sorbi:
Strong Enumeration Reducibilities.
Arch. Math. Log. 45(7): 869-912 (2006) |
2005 |
16 | EE | 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) |
2003 |
15 | EE | 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 |
14 | | Steffen Lempp,
Andrea Sorbi:
Embedding Finite Lattices into the Sigma02 Enumeration Degrees.
J. Symb. Log. 67(1): 69-90 (2002) |
2001 |
13 | EE | Marat M. Arslanov,
Iskander Sh. Kalimullin,
Andrea Sorbi:
Density results in the Delta20 e-degrees.
Arch. Math. Log. 40(8): 597-614 (2001) |
2000 |
12 | | Stanislaw Bereznyuk,
Richard Coles,
Andrea Sorbi:
The Distribution of Properly Sigma02 e-Degrees.
J. Symb. Log. 65(1): 19-32 (2000) |
11 | | André Nies,
Andrea Sorbi:
Structural Properties and Sigma02 Enumeration Degrees.
J. Symb. Log. 65(1): 285-292 (2000) |
1998 |
10 | | Andrea Sorbi:
Sets of Generators and Automorphism Bases for the Enumeration Degrees.
Ann. Pure Appl. Logic 94(1-3): 263-272 (1998) |
1996 |
9 | | 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) |
8 | | S. Barry Cooper,
Andrea Sorbi:
Noncappable Enumeration Degrees Below 0'e.
J. Symb. Log. 61(4): 1347-1363 (1996) |
7 | | Caterina Bianchini,
Andrea Sorbi:
A Note an Closed Degrees of Difculty of the Medvedev Lattice.
Math. Log. Q. 42: 127-133 (1996) |
1994 |
6 | | Andrea Sorbi,
Sandra Fontani,
Franco Montagna:
A Note on Relative Efficiency of Axiom Systems.
Math. Log. Q. 40: 261-272 (1994) |
1991 |
5 | | Andrea Sorbi:
Embedding Brouwer Algebras in the Medvedev Lattice.
Notre Dame Journal of Formal Logic 32(2): 266-275 (1991) |
1990 |
4 | | Andrea Sorbi:
Some Remarks on the Algebraic Structure of the Medvedev Lattice.
J. Symb. Log. 55(2): 831-853 (1990) |
1989 |
3 | | Franco Montagna,
Andrea Sorbi:
Creativeness and Completeness in Recursion Categories of Partial Recursive Operators.
J. Symb. Log. 54(3): 1023-1041 (1989) |
1985 |
2 | | Franco Montagna,
Andrea Sorbi:
Universal Recursion Theoretic Properties of R.E. Preordered Structures.
J. Symb. Log. 50(2): 397-406 (1985) |
1983 |
1 | | Claudio Bernardi,
Andrea Sorbi:
Classifying Positive Equivalence Relations.
J. Symb. Log. 48(3): 529-538 (1983) |