Order:
Disambiguations
Dorella Bellè [3]D. Bellè [2]
  1.  22
    Decidability of ∃*∀∀-sentences in HF.D. Bellè & F. Parlamento - 2008 - Notre Dame Journal of Formal Logic 49 (1):55-64.
    Let HF be the collection of the hereditarily finite well-founded sets and let the primitive language of set theory be the first-order language which contains binary symbols for equality and membership only. As announced in a previous paper by the authors, "Truth in V for ∃*∀∀-sentences is decidable," truth in HF for ∃*∀∀-sentences of the primitive language is decidable. The paper provides the proof of that claim.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  22
    The Decidability of the Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
    We show that the Axiom of Foundation, as well as the Antifoundation Axiom AFA, plays a crucial role in determining the decidability of the following problem. Given a first-order theory T over the language , and a sentence F of the form with quantifier-free in the same language, are there models of T in which F is true? Furthermore we show that the Extensionality Axiom is quite irrelevant in that respect.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  3.  26
    Truth in V for Ǝ ∀∀-Sentences Is Decidable.D. Bellé & F. Parlamento - 2006 - Journal of Symbolic Logic 71 (4):1200 - 1222.
    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, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  27
    Decidability and Completeness for Open Formulas of Membership Theories.Dorella Bellè & Franco Parlamento - 1995 - Notre Dame Journal of Formal Logic 36 (2):304-318.
    We establish the decidability, with respect to open formulas in the first order language with equality =, the membership relation , the constant for the empty set, and a binary operation w which, applied to any two sets x and y, yields the results of adding y as an element to x, of the theory NW having the obvious axioms for and w. Furthermore we establish the completeness with respect to purely universal sentences of the theory , obtained from NW (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation