- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c2 |      | Franco Parlamento, Flavio Previale: Cut Elimination for Gentzen's Sequent Calculus with Equality and Logic of Partial Terms. ICLA 2013: 161-172 |
| 2008 | ||
| j8 | | Dorella Bellè, Franco Parlamento: Decidability of THERE EXISTS * FOR ALL "FOR ALL"-sentences in HF. Notre Dame Journal of Formal Logic 49(1): 55-64 (2008) |
| 2006 | ||
| j7 | | Dorella Bellè, Franco Parlamento: Truth in V for THERE EXISTS * FOR ALL FOR ALL -sentences is decidable. J. Symb. Log. 71(4): 1200-1222 (2006) |
| 2001 | ||
| j6 | | Dorella Bellè, Franco Parlamento: The Decidability of the Class and the Axiom of Foundation. Notre Dame Journal of Formal Logic 42(1): 41-53 (2001) |
| 1996 | ||
| j5 |  | Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: Decidability of exist*forall-Sentences in Membership Theories. Math. Log. Q. 42: 41-58 (1996) |
| 1995 | ||
| j4 | | Dorella Bellè, Franco Parlamento: Decidability and Completeness for Open Formulas of Membership Theories. Notre Dame Journal of Formal Logic 36(2): 304-318 (1995) |
| 1993 | ||
| j3 | | Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. J. Symb. Comput. 15(5/6): 673-704 (1993) |
| 1991 | ||
| j2 | | Franco Parlamento, Alberto Policriti: Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. J. Autom. Reasoning 7(2): 271-284 (1991) |
| j1 | | Franco Parlamento, Alberto Policriti: Expressing Infinity Without Foundation. J. Symb. Log. 56(4): 1230-1235 (1991) |
| 1990 | ||
| c1 | | Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti: Truth Tables for a Combinatorial Kernel of Set Theories. ECAI 1990: 485-490 |
| 1 | Dorella Bellè | |
| 2 | Eugenio G. Omodeo (Eugenio Giovanni Omodeo) | |
| 3 | Alberto Policriti | |
| 4 | Flavio Previale |
Data released under the ODC-BY 1.0 license — See also our legal information page