The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations

DOI10.1016/j.entcs.2016.03.006zbMath1345.03020arXiv1506.01476WikidataQ113317699 ScholiaQ113317699MaRDI QIDQ737087

Domenico Cantone, Marianna Nicolosi-Asmundo

Publication date: 5 August 2016

Full work available at URL: https://arxiv.org/abs/1506.01476

zbMATH Keywords

satisfiability problem; set theory; restricted quantification; finite enumerations

Mathematics Subject Classification ID

03B25: Decidability of theories and sets of sentences

03E30: Axiomatics of classical set theory and its fragments