[1] F.Parlamento. Henkin’s Completeness Proof and Glivenko’s Theorem The Life and Work of Leon Henkin. Essays and Contributions M.Manzano, I. Sain, E.Alonso, eds. Studiens in Universal Logic series, 2014 pp. 217-223 Springer- Cham Heidelberg New York Dordrecht London
[2] F. Parlamento. Truth-value semantics and functional extensions for classi- cal logic of partial terms based on equality Notre Dame Journal of Formal Logic, vol 55, 2, 2014
[3] F. Parlamento, F. Previale. Cut Elimination for Gentzen’s Sequent Calcu- lus with Equality and Logic of Partial Terms in Proceedings of ICLA 2013 LNCS (2013) vol 7750, pp 161-172 Springer-Verlag, Berlin-Heidelberg
[4] D. Belle’ and F.Parlamento. Decidability of E*AA-sentences in HF Notre Dame Journal of Formal Logic, (2008) vol. 49, pp. 55–64
5] D. Belle’ and F.Parlamento. Truth in V for E*AA-sentences is decidable, The Journal of Symbolic Logic, (2006) vol. 71, pp. 1200–122
[6] D. Belle’ and F.Parlamento. The decidability of the A*E-class and the Axiom of Foundation Notre Dame Journal of Formal Logic (2003) vol. 42, pp. 41–53
[7] A. Marcone and F. Parlamento and A. Policriti. Finite families with few symmetric differences Proceedings of The American mathematical Society (1999) vol.127, pp. 835-845
[8] F. Parlamento and A. Policriti and KPSB. Rao Witnessing differences without redundancies Proceedings of The American mathematical Society (1997) vol.125, pp. 587–594
[9] F. Parlamento Elaborazione dell’Informazione Non Numerica Forum ed- itrice, Udine (1997) pp 99
[10] E. Omodeo and F. Parlamento and A. Policriti. Decidability of E*A- sentences in Membership Theories Mathematical Logic Quarterly (1996) vol.42, pp. 41-58
[11] D. Belle’ and F.Parlamento. Undecidability of weak membership theories LectureNotesinPureandAppliedMathematics M.Dekkered.(1996)vol. 180, pp. 327-337
[12] D. Belle’ and F.Parlamento. Decidability of the A*E* class in the theory NWL Notes in Logic n.6 183-194 in proceedings of Gdel ’96: Logical foun- dations of mathematics, computer science and physics—Kurt Gdel’s legacy, Brno, Czech Republic, August 1996 Lecture Notes in Mathematical Logic (1996) vol. 6, pp. 183-194, Springer-Verlag ed.
[13] D. Belle’ and F.Parlamento. Decidability and Completeness for Open For- mulas of Membership Theories Notre Dame Journal of Formal Logic, (1995) vol. 36, pp. 304-318
[14] F. Parlamento and A. Policriti. Undecidability Results for Restricted Uni- versally Quantified Formulae of Set Theory Communications on Pure and Applied Mathematics (1993) vol XLVI, pp. 57-73
[15] E. Omodeo and F. Parlamento and A. Policriti A Derived Algorithm for evaluating epsilon-expressions over sets The Journal of Symbolic Logic (1993) vol.15, pp. 673-704
[16] F. Parlamento and A. Policriti. Expressing Infinity Without Foundation The Journal of Symbolic Logic (1991) vol 56, pp.1230–123
[17] F. Parlamento and A. Policriti. Decision Procedures for Elementary Sub- languages of Set Theory XIII. Model Graphs, Reflection and Decidability. Journal of Automated reasoning (1991) vol 7, pp. 271–284
[18] F. Parlamento. logic and Logic Programming in Mathematics of Computing- Unesco Project Applied Mathematics and Informatics for De- veloping Countries F. Luccio, A. Marzollo, P.Serafini eds. (1991) pp. 389- 486, International Center for Mechanical Sciences CISM
[19] F. Parlamento and A. Policriti. Note on: The Logically Simplest Form of the Infinity Axiom Proceedings of The American Mathematical Society (1990) vol 110
[20] E. Omodeo and F. Parlamento and A. Policriti. Truth Table for a Combi- natorial Kernel of Set Theories In Proceeding of the European Conference on Artificial Intelligence ECAI 9- Stoccolma
[21] E. Omodeo and F. Parlamento and A. Policriti. A contribution to the Automated Treatment of Membership Theories Atti del V Convegno sulla programmazione Logica- Padova 6-8.6.1990
[22] F. Parlamento and A. Policriti. The Logically Simplest Form of the Infinity Axiom Proceedings of The American Mathematical Society (1990) vol 108, pp 274–276
[23] F. Parlamento and A. Policriti. The Logically Simplest Form of the Infinity Axiom Proceedings of The American Mathematical Society (1990) vol 108, pp 274–276
[24] F. Parlamento and A. Policriti. Decision Procedures for Elementary Sub- languages of Set Theory XI. Unsolvability of the Decision Problem for a Restricted Subclass of the ∆0-Formulas in Set Theory Communications on Pure and Applied Mathematics (1988) vol XLI pp. 221–251
[25] F. Parlamento Reflection and Induction Principles Relative to Primi- tive recursive Arithmetic In Atti del Congresso Internazionale di Logica e Filosofia della Scienza- San Gimignano 7-11/Dicembre 1986
[26] F. Parlamento. Regole e Principi di di Induzione Ristretti Relativi s PRA In Atti degli Incontri di Logica- Siena (1985) Vol.2
[27] F. Parlamento. Iterated Reflection Principles and Induction Principles over Primitive recursive Arithmetic Bulletin (New Series) of teh Amer- ican Mathematical Society (1984) vol.5
[28] F. Parlamento. PRA Provability of Schmerl’s Fine Structure Theorem Rendiconti del Seminario Matematico dell’Universita’ di Torino (1984) vol. 42
[29] F. Parlamento. Binumerability in a Sequence of Theories Rendiconti del Seminario Matematico dell’Universita’ di Padova (1981) vol. 65
[30] F. Parlamento. Sulla Completezza della omega-regola Rendiconti del Sem- inario Matematico dell’Universita’ di Torino (1979) vol. 36
[31] F. Parlamento. Sui Sistemi Metaformali e le Progressioni Ricorsive di teorie Bollettino dell’Unione Matematica Italiana. A (1978) vol. XV