| 2005 |
|---|
| 12 | EE | Andrea Cantini:
Remarks on applicative theories.
Ann. Pure Appl. Logic 136(1-2): 91-115 (2005) |
| 2004 |
|---|
| 11 | EE | Andrea Cantini,
Valentin Goranko:
Nicholas Rescher, "Paradoxes: Their Roots, Range, and Resolution"; Patrick Blackburn, Maarten de Rijke and Yde Venema, "Modal Logic", Cambridge Tracts in Theoretical Computer Science Volume 53.
Studia Logica 76(1): 135-142 (2004) |
| 2003 |
|---|
| 10 | | Andrea Cantini:
The Undecidability of Grisin's Set Theory.
Studia Logica 74(3): 345-368 (2003) |
| 2002 |
|---|
| 9 | EE | Andrea Cantini:
Polytime, combinatory logic and positive safe induction.
Arch. Math. Log. 41(2): 169-189 (2002) |
| 2000 |
|---|
| 8 | EE | Andrea Cantini:
Feasible Operations and Applicative Theories Based on lambda-eta.
Math. Log. Q. 46(3): 291-312 (2000) |
| 1999 |
|---|
| 7 | | Andrea Cantini,
Pierluigi Minari:
Uniform Inseparability in Explicit Mathematics.
J. Symb. Log. 64(1): 313-326 (1999) |
| 6 | | Andrea Cantini:
Relating Quine's NF to Feferman`s EM.
Studia Logica 62(2): 141-162 (1999) |
| 1996 |
|---|
| 5 | | Andrea Cantini:
Asymmetric Interpretations for Bounded Theories.
Math. Log. Q. 42: 270-288 (1996) |
| 1995 |
|---|
| 4 | | Andrea Cantini:
Levels of Truth.
Notre Dame Journal of Formal Logic 36(2): 185-213 (1995) |
| 1993 |
|---|
| 3 | | Andrea Cantini:
Extending the First-Order Theory of Combinators with Self-Referential Truth.
J. Symb. Log. 58(2): 477-513 (1993) |
| 1990 |
|---|
| 2 | | Andrea Cantini:
A Theory of Formal Truth Arithmetically Equivalent to ID1.
J. Symb. Log. 55(1): 244-259 (1990) |
| 1986 |
|---|
| 1 | | Andrea Cantini:
On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic.
J. Symb. Log. 51(2): 360-373 (1986) |
