| |
| * | 2007 | |
|---|---|---|
| 10 | EE | Paolo Gentilini: Paraconsistent Arithmetic with a Local Consistency Operator and Global Selfreference. Electr. Notes Theor. Comput. Sci. 169: 73-86 (2007) |
| 2005 | ||
| 9 | EE | Paola Forcheri, Paolo Gentilini: Paraconsistent Informational Logic. J. Applied Logic 3(1): 97-118 (2005) |
| 8 | Paola Forcheri, Paolo Gentilini: Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework. Journal of Applied Non-Classical Logics 15(3): 285-319 (2005) | |
| 1999 | ||
| 7 | Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino: Informational Logic in Knowledge Representation and Automated Deduction. AI Commun. 12(4): 185-208 (1999) | |
| 6 | Paolo Gentilini: Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric. Studia Logica 63(1): 27-48 (1999) | |
| 5 | Paolo Gentilini: Proof-Theoretic Modal PA-Completeness II: The Syntactic Countermodel. Studia Logica 63(2): 245-268 (1999) | |
| 4 | Paolo Gentilini: Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Studia Logica 63(3): 301-310 (1999) | |
| 1998 | ||
| 3 | Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino: Informational Logic as a Tool for Automated Reasoning. J. Autom. Reasoning 20(1): 167-190 (1998) | |
| 1996 | ||
| 2 | EE | Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino: Informational Logic for Automated Reasoning. JELIA 1996: 354-372 |
| 1993 | ||
| 1 | Paolo Gentilini: Syntactical results on the arithmetical completeness of modal logic. Studia Logica 52(4): 549-564 (1993) | |
| 1 | Paola Forcheri | [2] [3] [7] [8] [9] |
| 2 | Maria Teresa Molfino | [2] [3] [7] |