Decidability and completeness for open formulas of membership theories
type: Item
instance of: scholarly article
title: Decidability and completeness for open formulas of membership theories
zbMATH Open document ID: 0837.03007
author: Dorella Bellè
author: Franco Parlamento
published in: Notre Dame Journal of Formal Logic
publication date: 1996-05-13T00:00:00Z
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 824605
zbMATH Keywords: decidability
zbMATH Keywords: open formulas
zbMATH Keywords: completeness
zbMATH Keywords: extensionality axiom
zbMATH Keywords: regularity axiom
zbMATH Keywords: antifoundation axiom
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1040248461
OpenAlex ID: W1965171814
cites work: Q3992552
cites work: Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
cites work: On the interpretability of arithmetic in set theory
cites work: Q3905252
cites work: Q3856727
cites work: A minimal predicative set theory
cites work: Decidability of ∀*∀‐Sentences in Membership Theories
cites work: Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
cites work: Expressing infinity without foundation
cites work: THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
cites work: Undecidability results for restricted universally quantified formulae of set theory
cites work: Witnessing differences without redundancies
cites work: Undecidable theories
DOI: 10.1305/NDJFL/1040248461
description: scientific article; zbMATH DE number 824605