Journal of Symbolic Logic

Truth in V for ∃*∀∀-sentences is decidable

D. Bellé and F. Parlamento

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Let V be the cumulative set theoretic hierarchy, generated from the empty set by taking powers at successor stages and unions at limit stages and, following [2], let the primitive language of set theory be the first order language which contains binary symbols for equality and membership only. Despite the existence of ∀∀-formulae in the primitive language, with two free variables, which are satisfiable in V but not by finite sets ([5]), and therefore of ∃∃∀∀ sentences of the same language, which are undecidable in ZFC without the Axiom of Infinity, truth in V for ∃*∀∀-sentences of the primitive language, is decidable ([1]). Completeness of ZF with respect to such sentences follows.

Article information

Source
J. Symbolic Logic, Volume 71, Issue 4 (2006), 1200-1222.

Dates
First available in Project Euclid: 20 November 2006

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1164060452

Digital Object Identifier
doi:10.2178/jsl/1164060452

Mathematical Reviews number (MathSciNet)
MR2275856

Zentralblatt MATH identifier
1109.03057

Subjects
Primary: Primary 03B25, Secondary 03E30, 03C62

Citation

Bellé, D.; Parlamento, F. Truth in V for ∃ * ∀∀-sentences is decidable. J. Symbolic Logic 71 (2006), no. 4, 1200--1222. doi:10.2178/jsl/1164060452. https://projecteuclid.org/euclid.jsl/1164060452


Export citation

References

  • D. Bellè, The decision problem for extensional set theories, Ph.D. thesis, Università di Siena, 1998.
  • H. Friedman, Three quantifier sentences, Fundamenta Mathematicae, vol. 177 (2003), pp. 213--240.
  • D. Gogol, The $\forall_n \exists$-completeness of Zermelo-Fraenkel set theory, Zeitschrift für mathematische Logik und die Grundlagen der Mathematik, vol. 24 (1978), pp. 289--290.
  • E. Omodeo, F. Parlamento, and A. Policriti, Decidability of $\exists^*\forall$-sentences in membership theories, Mathematical Logic Quarterly, vol. 42 (1996), pp. 41--58.
  • F. Parlamento and A. Policriti, Note on: The logically simplest form of the infinity axiom, Proceedings of the American Mathematical Society, vol. 108 (1990), pp. 285--286.
  • --------, Expressing infinity without foundation, Journal of Symbolic Logic, vol. 56 (1991), no. 4, pp. 1230--1235.
  • F. Parlamento, A. Policriti, and K. P. S. Rao, Witnessing differences without redundancies, Proceedings of the American Mathematical Society, vol. 125 (1997), pp. 587--594.