- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j18 |      | Stefano Baratella: Quantum coherent spaces and linear logic. RAIRO - Theor. Inf. and Applic. 44(4): 419-441 (2010) |
| 2006 | ||
| j17 | | Stefano Baratella, Andrea Masini: A note on unbounded metric temporal logic over dense time domains. Math. Log. Q. 52(5): 450-456 (2006) |
| 2004 | ||
| j16 | | Stefano Baratella, Andrea Masini: An approach to infinitary temporal proof theory. Arch. Math. Log. 43(8): 965-990 (2004) |
| j15 | | Stefano Baratella, Andrea Masini: A Way of Making World Quantification Explicit. Logic Journal of the IGPL 12(3): 199-225 (2004) |
| j14 | | Stefano Baratella, Andrea Masini: An infinitary variant of Metric Temporal Logic over dense time domains. Math. Log. Q. 50(3): 249-257 (2004) |
| 2003 | ||
| j13 | | Stefano Baratella, Andrea Masini: A proof-theoretic investigation of a logic of positions. Ann. Pure Appl. Logic 123(1-3): 135-162 (2003) |
| j12 | | Stefano Baratella, Siu-Ah Ng: Consequences of neocompact quantifier elimination. Math. Log. Q. 49(2): 150-162 (2003) |
| 2001 | ||
| j11 | | Stefano Baratella, Siu-Ah Ng: Neocompact quantifier elimination in structures based on Banach spaces. Ann. Pure Appl. Logic 111(1-2): 115-143 (2001) |
| 1998 | ||
| j10 | | Stefano Baratella, Carlo Toffalori: The theory of [(Z)\vec]C(2)2{\vec Z}C(2)^2-lattices is decidable. Arch. Math. Log. 37(2): 91-104 (1998) |
| j9 | | Stefano Baratella, Stefano Berardi: Approximating Classical Theorems. J. Log. Comput. 8(6): 839-854 (1998) |
| 1997 | ||
| j8 | | Stefano Baratella, Stefano Berardi: A parallel game semantics for Linear Logic. Arch. Math. Log. 36(3): 189-217 (1997) |
| 1995 | ||
| j7 |  | Ruggero Ferro, Stefano Baratella: Non Standard Regular Finite Set Theory. Math. Log. Q. 41: 161-172 (1995) |
| 1994 | ||
| j6 | | Stefano Baratella: A Modal Approach to Negation as Failure Rule. J. Log. Comput. 4(4): 359-373 (1994) |
| 1993 | ||
| j5 | | Ruggero Ferro, Stefano Baratella: A Theory of Sets with the Negation of the Axiom of Inflnity. Math. Log. Q. 39: 338-352 (1993) |
| j4 | | Stefano Baratella: A Class of Programs for which SLDNF Resolution and NAF Rule are Complete. Theor. Comput. Sci. 120(1): 83-99 (1993) |
| 1992 | ||
| j3 | | Stefano Baratella: A Completeness Result for Allowed Semi-Strict Programs with Respect to Well-Behaved and Allowed Query Clauses. Theor. Comput. Sci. 97(1): 143-156 (1992) |
| 1991 | ||
| j2 | | Stefano Baratella: Models of Clark's completion for some classes of logic programs. Fundam. Inform. 14(3): 323-337 (1991) |
| 1988 | ||
| j1 | | Stefano Baratella, Gilberto Filé: A completeness result for SLDNF resoultion. Bulletin of the EATCS 35: 97-105 (1988) |
| 1 | Stefano Berardi | |
| 2 | Ruggero Ferro | |
| 3 | Gilberto Filé | |
| 4 | Andrea Masini | |
| 5 | Siu-Ah Ng | |
| 6 | Carlo Toffalori |
Data released under the ODC-BY 1.0 license — See also our legal information page