THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION

DOI10.1002/malq.19920380110zbMath0794.03016OpenAlexW1977107423WikidataQ114696417 ScholiaQ114696417MaRDI QIDQ4295224

Alberto Policriti, Franco Parlamento

Publication date: 11 July 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380110

zbMATH Keywords

decidabilityaxiom of foundationfinite set-satisfiability probleminfinitely many urelements

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Axiomatics of classical set theory and its fragments (03E30)

Related Items (2)

Decidability and completeness for open formulas of membership theories ⋮ Witnessing differences without redundancies

This page was built for publication: THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION