Decidable sublanguages of set theory

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]


  1. ^ 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.
  2. ^ "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
  3. ^ "A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions", by Domenico Cantone and et al.
  4. ^ "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
Retrieved from ""
This content was retrieved from Wikipedia :
This page is based on the copyrighted Wikipedia article "Decidable sublanguages of set theory"; it is used under the Creative Commons Attribution-ShareAlike 3.0 Unported License (CC-BY-SA). You may redistribute it, verbatim or modified, providing that you comply with the terms of the CC-BY-SA