| 2011 | ||
|---|---|---|
| j14 | Andrea Cantini: Extending constructive operational set theory by impredicative principles. Math. Log. Q. 57(3): 299-322 (2011) | |
| 2005 | ||
| j13 | ||
| 2004 | ||
| j12 | 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 | ||
| j11 | ||
| j10 | ||
| 2002 | ||
| j9 | Andrea Cantini: Polytime, combinatory logic and positive safe induction. Arch. Math. Log. 41(2): 169-189 (2002) | |
| 2000 | ||
| j8 | Andrea Cantini: Feasible Operations and Applicative Theories Based on lambda-eta. Math. Log. Q. 46(3): 291-312 (2000) | |
| 1999 | ||
| j7 | Andrea Cantini, Pierluigi Minari: Uniform Inseparability in Explicit Mathematics. J. Symb. Log. 64(1): 313-326 (1999) | |
| j6 | ||
| 1996 | ||
| j5 | ||
| 1995 | ||
| j4 | ||
| 1993 | ||
| j3 | Andrea Cantini: Extending the First-Order Theory of Combinators with Self-Referential Truth. J. Symb. Log. 58(2): 477-513 (1993) | |
| 1990 | ||
| j2 | Andrea Cantini: A Theory of Formal Truth Arithmetically Equivalent to ID1. J. Symb. Log. 55(1): 244-259 (1990) | |
| 1986 | ||
| j1 | Andrea Cantini: On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic. J. Symb. Log. 51(2): 360-373 (1986) | |
| 1 | Valentin Goranko | |
| 2 | Pierluigi Minari |
Data released under the ODC-BY 1.0 license — See also our legal information page