2001 |
7 | | 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 |
6 | | Eugenio G. Omodeo,
Franco Parlamento,
Alberto Policriti:
Decidability of exist*forall-Sentences in Membership Theories.
Math. Log. Q. 42: 41-58 (1996) |
1995 |
5 | | 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 |
4 | | 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 |
3 | | 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) |
2 | | Franco Parlamento,
Alberto Policriti:
Expressing Infinity Without Foundation.
J. Symb. Log. 56(4): 1230-1235 (1991) |
1990 |
1 | | Eugenio G. Omodeo,
Franco Parlamento,
Alberto Policriti:
Truth Tables for a Combinatorial Kernel of Set Theories.
ECAI 1990: 485-490 |