| 2005 |
|---|
| 15 | EE | Alessandro Berarducci,
Margarita Otero,
Ya'acov Peterzil,
Anand Pillay:
A descending chain condition for groups definable in o-minimal structures.
Ann. Pure Appl. Logic 134(2-3): 303-313 (2005) |
| 2004 |
|---|
| 14 | EE | Alessandro Berarducci,
Tamara Servi:
An effective version of Wilkie's theorem of the complement and some effective o-minimality results.
Ann. Pure Appl. Logic 125(1-3): 43-74 (2004) |
| 2003 |
|---|
| 13 | | Alessandro Berarducci,
Margarita Otero:
Transfer methods for o-minimal topology.
J. Symb. Log. 68(3): 785-794 (2003) |
| 2001 |
|---|
| 12 | EE | Alessandro Berarducci,
Corrado Böhm:
General Recursion on Second Order Term Algebras.
RTA 2001: 15-30 |
| 11 | | Alessandro Berarducci,
Margarita Otero:
Intersection theory for 0-minimal manifolds.
Ann. Pure Appl. Logic 107(1-3): 87-119 (2001) |
| 1999 |
|---|
| 10 | EE | Alessandro Berarducci,
Mariangiola Dezani-Ciancaglini:
Infinite lambda-Calculus and Types.
Theor. Comput. Sci. 212(1-2): 29-75 (1999) |
| 1996 |
|---|
| 9 | | Alessandro Berarducci,
Margarita Otero:
A Recursive Nonstandard Model of Normal Open Induction.
J. Symb. Log. 61(4): 1228-1241 (1996) |
| 1995 |
|---|
| 8 | | Alessandro Berarducci,
Paola D'Aquino:
Delta0-Complexity of the Relation y = \prodi <= n F(i).
Ann. Pure Appl. Logic 75(1-2): 49-56 (1995) |
| 1993 |
|---|
| 7 | | Alessandro Berarducci,
Rineke Verbrugge:
On the Provability Logic of Bounded Arithmetic.
Ann. Pure Appl. Logic 61(1-2): 75-93 (1993) |
| 6 | | Alessandro Berarducci,
Marisa Venturini Zilli:
Generalizations of Unification.
J. Symb. Comput. 16(5): 479-491 (1993) |
| 5 | | Alessandro Berarducci,
Benedetto Intrigila:
Some New Results on Easy lambda-Terms.
Theor. Comput. Sci. 121(1&2): 71-88 (1993) |
| 1992 |
|---|
| 4 | | Alessandro Berarducci,
Corrado Böhm:
A Self-Interpreter of Lambda Calculus Having a Normal Form.
CSL 1992: 85-99 |
| 1991 |
|---|
| 3 | | Alessandro Berarducci,
Benedetto Intrigila:
Combinatorial Principles in Elementary Number Theory.
Ann. Pure Appl. Logic 55(1): 35-50 (1991) |
| 1990 |
|---|
| 2 | | Alessandro Berarducci:
The Interpretability Logic of Peano Arithmetic.
J. Symb. Log. 55(3): 1059-1089 (1990) |
| 1985 |
|---|
| 1 | | Corrado Böhm,
Alessandro Berarducci:
Automatic Synthesis of Typed Lambda-Programs on Term Algebras.
Theor. Comput. Sci. 39: 135-154 (1985) |
