Decidable sublanguages of set theory

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Decidable sublanguages of set theory" – news · newspapers · books · scholar · JSTOR (May 2021) (Learn how and when to remove this message)

In mathematical logic, various sublanguages of set theory are decidable.^[1]^[2] These include:

Sets with Monotone, Additive, and Multiplicative Functions.^[3]
Sets with restricted quantifiers.^[4]

References

^ Cantone, D., E. G. Omodeo and A. Policriti, "Set Theory for Computing. From Decision Procedures to Logic Programming with Sets," Monographs in Computer Science, Springer, 2001.
^ "Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability", by Franco Parlamento and Alberto Policriti Journal of Automated Reasoning, Volume 7, Issue 2 (June 1991), Pages: 271 - 284
^ "A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions", by Domenico Cantone and et al.
^ "A tableau-based decision procedure for a fragment of set theory involving a restricted form of quantification", by Domenico Cantone, Calogero G. Zarba, Viale A. Doria, 1997^{[permanent dead link]}

Retrieved from "https://en.wikipedia.org/w/index.php?title=Decidable_sublanguages_of_set_theory&oldid=1197703828"