Bellè, D.; Parlamento, F. Decidability of \(\exists^*\forall\forall\)-sentences in HF. (English) Zbl 1180.03011 Notre Dame J. Formal Logic 49, No. 1, 55-64 (2008). MSC: 03B25 03C62 03E30 PDFBibTeX XMLCite \textit{D. Bellè} and \textit{F. Parlamento}, Notre Dame J. Formal Logic 49, No. 1, 55--64 (2008; Zbl 1180.03011)
Bellé, D.; Parlamento, F. Truth in \(V\) for \(\exists^*\forall\forall\)-sentences is decidable. (English) Zbl 1109.03057 J. Symb. Log. 71, No. 4, 1200-1222 (2006). MSC: 03E30 03B25 03C62 PDFBibTeX XMLCite \textit{D. Bellé} and \textit{F. Parlamento}, J. Symb. Log. 71, No. 4, 1200--1222 (2006; Zbl 1109.03057) Full Text: DOI
Bellè, Dorella; Parlamento, Franco The decidability of the \(\forall ^*\exists\) class and the axiom of foundation. (English) Zbl 1023.03007 Notre Dame J. Formal Logic 42, No. 1, 41-53 (2001). MSC: 03B25 03E65 03C62 PDFBibTeX XMLCite \textit{D. Bellè} and \textit{F. Parlamento}, Notre Dame J. Formal Logic 42, No. 1, 41--53 (2001; Zbl 1023.03007) Full Text: DOI
Bellè, Dorella; Parlamento, Franco Undecidability in weak membership theories. (English) Zbl 0858.03014 Ursini, Aldo (ed.) et al., Logic and algebra. Proceedings of the international conference dedicated to the memory of Roberto Magari, April 26–30, 1994, Pontignano, Italy. New York, NY: Marcel Dekker. Lect. Notes Pure Appl. Math. 180, 327-337 (1996). Reviewer: J.M.Plotkin (East Lansing) MSC: 03B25 03E30 PDFBibTeX XMLCite \textit{D. Bellè} and \textit{F. Parlamento}, Lect. Notes Pure Appl. Math. 180, 327--337 (1996; Zbl 0858.03014)
Bellè, Dorella; Parlamento, Franco Decidability of the \(\exists^*\forall^*\)-class in the membership theory NWL. (English) Zbl 0858.03015 Hájek, Petr (ed.), Gödel ’96. Logical foundations of mathematics, computer science and physics – Kurt Gödel’s legacy. Proceedings of a conference, Brno, Czech Republic, August 1996. Berlin: Springer-Verlag. Lect. Notes Log. 6, 183-194 (1996). Reviewer: J.M.Plotkin (East Lansing) MSC: 03B25 03E30 PDFBibTeX XMLCite \textit{D. Bellè} and \textit{F. Parlamento}, Lect. Notes Log. 6, 183--194 (1996; Zbl 0858.03015)
Omodeo, Eugenio G.; Parlamento, Franco; Policriti, Alberto Decidability of \(\exists^* \forall\)-sentences in membership theories. (English) Zbl 0836.03011 Math. Log. Q. 42, No. 1, 41-58 (1996). MSC: 03B25 03E30 03D15 PDFBibTeX XMLCite \textit{E. G. Omodeo} et al., Math. Log. Q. 42, No. 1, 41--58 (1996; Zbl 0836.03011) Full Text: DOI
Bellè, Dorella; Parlamento, Franco Decidability and completeness for open formulas of membership theories. (English) Zbl 0837.03007 Notre Dame J. Formal Logic 36, No. 2, 304-318 (1995). MSC: 03B25 PDFBibTeX XMLCite \textit{D. Bellè} and \textit{F. Parlamento}, Notre Dame J. Formal Logic 36, No. 2, 304--318 (1995; Zbl 0837.03007) Full Text: DOI
Parlamento, F.; Policriti, A. Undecidability results for restricted universally quantified formulae of set theory. (English) Zbl 0797.03005 Commun. Pure Appl. Math. 46, No. 1, 57-73 (1993). MSC: 03B25 03E99 03D35 03D10 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, Commun. Pure Appl. Math. 46, No. 1, 57--73 (1993; Zbl 0797.03005) Full Text: DOI
Omodeo, Eugenio G.; Parlamento, Franco; Policriti, Alberto A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets. (English) Zbl 0796.03009 J. Symb. Comput. 15, No. 5-6, 673-704 (1993). MSC: 03B25 03E30 03B35 03B70 68Q60 68Q65 PDFBibTeX XMLCite \textit{E. G. Omodeo} et al., J. Symb. Comput. 15, No. 5--6, 673--704 (1993; Zbl 0796.03009) Full Text: DOI
Parlamento, Franco; Policriti, Alberto The decision problem for restricted universal quantification in set theory and the axiom of foundation. (English) Zbl 0794.03016 Z. Math. Logik Grundlagen Math. 38, No. 2, 143-156 (1992). Reviewer: F.Parlamento MSC: 03B25 03E30 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, Z. Math. Logik Grundlagen Math. 38, No. 2, 143--156 (1992; Zbl 0794.03016) Full Text: DOI
Parlamento, Franco; Policriti, Alberto Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability. (English) Zbl 0734.03006 J. Autom. Reasoning 7, No. 2, 271-284 (1991). MSC: 03B25 03E99 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, J. Autom. Reasoning 7, No. 2, 271--284 (1991; Zbl 0734.03006) Full Text: DOI
Parlamento, Franco; Policriti, Alberto Note on “The logically simplest form of the infinity axiom”. (English) Zbl 0694.03031 Proc. Am. Math. Soc. 108, No. 1, 285-286 (1990). MSC: 03E30 03B25 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, Proc. Am. Math. Soc. 108, No. 1, 285--286 (1990; Zbl 0694.03031) Full Text: DOI Link
Parlamento, Franco; Policriti, Alberto The logically simplest form of the infinity axiom. (English) Zbl 0681.03032 Proc. Am. Math. Soc. 103, No. 1, 274-276 (1988). MSC: 03E30 03B25 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, Proc. Am. Math. Soc. 103, No. 1, 274--276 (1988; Zbl 0681.03032) Full Text: DOI
Parlamento, Franco; Policriti, Alberto Decision procedures for elementary sublanguages of set theory. IX: Unsolvability of the decision problem for a restricted subclass of the \(\Delta _ 0\) formulas in set theory. (English) Zbl 0632.03009 Commun. Pure Appl. Math. 41, No. 2, 221-251 (1988). MSC: 03B25 03E99 PDFBibTeX XMLCite \textit{F. Parlamento} and \textit{A. Policriti}, Commun. Pure Appl. Math. 41, No. 2, 221--251 (1988; Zbl 0632.03009) Full Text: DOI