Decidability of ∀*∀‐Sentences in Membership Theories
Work
Year: 1996
Type: article
Abstract: The problem is addressed of establishing the satisfiability of prenex formulas involving a single universal quantifier, in diversified axiomatic set theories. A rather general decision method for sol... more
Source: Mathematical logic quarterly
Institutions University of Salerno, University of Udine
Cites: 21
Cited by: 24
Related to: 10
FWCI: 1.362
Citation percentile (by year/subfield): 71.28
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: green