Search the dblp DataBase
Franco Parlamento: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
Truth Tables for a Combinatorial Kernel of Set Theories. [Citation Graph (0, 0)][DBLP]
ECAI, 1990, pp:485-490 [Conf] - Franco Parlamento, Alberto Policriti
Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. [Citation Graph (0, 0)][DBLP]
J. Autom. Reasoning, 1991, v:7, n:2, pp:271-284 [Journal] - Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. [Citation Graph (0, 0)][DBLP]
J. Symb. Comput., 1993, v:15, n:5/6, pp:673-704 [Journal] - Franco Parlamento, Alberto Policriti
Expressing Infinity Without Foundation. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1991, v:56, n:4, pp:1230-1235 [Journal] - Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti
Decidability of exist*forall-Sentences in Membership Theories. [Citation Graph (0, 0)][DBLP]
Math. Log. Q., 1996, v:42, n:, pp:41-58 [Journal] - Dorella Bellè, Franco Parlamento
The Decidability of the Class and the Axiom of Foundation. [Citation Graph (0, 0)][DBLP]
Notre Dame Journal of Formal Logic, 2001, v:42, n:1, pp:41-53 [Journal] - Dorella Bellè, Franco Parlamento
Decidability and Completeness for Open Formulas of Membership Theories. [Citation Graph (0, 0)][DBLP]
Notre Dame Journal of Formal Logic, 1995, v:36, n:2, pp:304-318 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002