Combining Sets with Cardinals

We introduce a quantifier-free set-theoretic language for combining sets with elements in the presence of the cardinality operator. We prove that the language is decidable by providing a combination method specifically tailored to the combination domain of sets, cardinal numbers, and elements. Our method uses as black boxes a decision procedure for the elements and a decision procedure for cardinal numbers. To be correct, our method requires that the theory of elements be stably infinite. However, we show that if we restrict set variables to range over finite sets only, then one can modify our method so that it works even when the theory of the elements is not stably infinite.

[1]  Calogero G. Zarba.  Combining Multisets with Integers , 2002, CADE.

[2]  Cesare Tinelli,et al.  Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing , 2003, Journal of Automated Reasoning.

[3]  Domenico Cantone,et al.  What Is Computable Set Theory , 1990 .

[4]  Alexander Aiken,et al.  Set Constraints: Results, Applications, and Future Directions , 1994, PPCP.

[5]  Calogero G. Zarba,et al.  Combining Non-Stably Infinite Theories , 2003, FTP.

[6]  Viktor Kuncak,et al.  The First-Order Theory of Sets with Cardinality Constraints is Decidable , 2004, ArXiv.

[7]  Calogero G. Zarba,et al.  A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning , 2000, TABLEAUX.

[8]  Derek C. Oppen,et al.  Complexity, Convexity and Combinations of Theories , 1980, Theor. Comput. Sci..

[9]  Alexander Aiken,et al.  Introduction to Set Constraint-Based Program Analysis , 1999, Sci. Comput. Program..

[10]  J. Schwartz,et al.  Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensions , 1980 .

[11]  Domenico Cantone,et al.  Set Theory for Computing , 2001, Monographs in Computer Science.

[12]  Calogero G. ZarbaStanford.  Combining Lists with Integers ? , 2001 .

[13]  Charles Gregory Nelson,et al.  Techniques for program verification , 1979 .

[14]  Vincenzo Cutello,et al.  Decision Problems for Tarski and Presburger Arithmetics Extended With Sets , 1990, CSL.

[15]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[16]  S. Feferman,et al.  The first order properties of products of algebraic systems , 1959 .

[17]  J. Venn,et al.  . On the diagrammatic and mechanical representation of propositions and reasonings , 2022 .

[18]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[19]  Calogero G. Zarba,et al.  A tableau al ulus for integrating rst-orderreasoning with elementary set theory reasoning ? , 2000 .

[20]  Calogero G. Zarba.  Combining Sets with Elements , 2003, Verification: Theory and Practice.

[21]  Cesare Tinelli,et al.  Unions of non-disjoint theories and combinations of satisfiability procedures , 2003, Theor. Comput. Sci..

[22]  Silvio Ghilardi,et al.  Quantifier Elimination and Provers Integration , 2003, FTP.

[23]  Calogero G. Zarba,et al.  Combining Nonstably Infinite Theories , 2005, Journal of Automated Reasoning.

[24]  Calogero G. Zarba.  A Quantifier Elimination Algorithm for a Fragment of Set Theory Involving the Cardinality Operator , 2004 .

[25]  Calogero G. Zarba,et al.  Combining Sets with Integers , 2002, FroCoS.

[26]  Sydney Young,et al.  I. On the boiling-points of homologous compounds , 1905 .