Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aiken, A.: Set constraints: Results, applications, and future directions, in A. Borning (ed.), Principles and Practice of Constraint Programming, Lecture Notes in Comput. Sci. 874, Springer, 1994, pp. 326–335.
Aiken, A.: Introduction to set constraint-based program analysis, Science of Computer Programming 35(2) (1999), 79–111.
Cantone, D. and Cutello, V.: A decision procedure for set-theoretic formulae involving rank and cardinality comparison, in A. Bertoni, C. Böhm and P. Miglioli (eds.), Italian Conference on Theoretical Computer Science, World Scientific, 1989, pp. 150–163.
Cantone, D., Cutello, V. and Schwartz, J. T.: Decision problems for Tarski and Presburger arithmetics extended with sets, in E. Börger, H. K. Büning, M. M. Richter and W. Schönfeld (eds.), Computer Science Logic, Lecture Notes in Comput. Sci. 533, Springer, 1991, pp. 95–109.
Cantone, D., Ferro, A. and Omodeo, E. G.: Computable Set Theory, International Series of Monographs on Computer Science 6, Clarendon Press, 1989.
Cantone, D., Omodeo, E. G. and Policriti, A.: Set Theory for Computing: From Decision Procedures to Logic Programming with Sets, Monographs in Computer Science, Springer, 2001.
Cantone, D. and Zarba, C. G.: A tableau calculus for integrating first-order reasoning with elementary set theory reasoning, in R. Dyckhoff (ed.), Automated Reasoning with Analytic Tableaux and Related Methods, Lecture Notes in Comput. Sci. 1847, Springer, 2000, pp. 143–159.
Feferman, S. and Vaught, R. L.: The first-order properties of products of algebraic systems, Fund. Math. 47 (1959), 57–103.
Ferro, A., Omodeo, E. G. and Schwartz, J. T.: Decision procedures for elementary sublanguages of set theory, I: Multi-level syllogistic and some extensions, Comm. Pure Appl. Math. 33(5) (1980), 599–608.
Ghilardi, S.: Quantifier elimination and provers integration, in I. Dahn and L. Vigneron (eds.), First Order Theorem Proving, Electron. Notes in Theoret. Comput. Sci. 86.1, Elsevier,2003.
Heintze, N. and Jaffar, J.: A decision procedure for a class of set constraints, in J. Mitchell (ed.), 5th Annual IEEE Symposium on Logic in Computer Science, 1990, pp. 42–51.
Kuncak, V. and Rinard, M.: The first-order theory of sets with cardinality constraints is decidable, Technical Report CSAIL-958, Massachusetts Institute of Technology, 2004.
Mostowski, A. and Tarski, A.: Arithmetical classes and types of well-ordered systems, Bull. Amer. Math. Soc. 55 (1949), 65.
Nelson, G.: Techniques for program verification, Technical Report CSL-81-10, Xerox Palo Alto Research Center, 1981.
Nelson, G. and Oppen, D. C.: Simplification by cooperating decision procedures, ACM Transactions on Programming Languages and Systems 1(2) (1979), 245–257.
Oppen, D. C.: Complexity, convexity and combination of theories, Theoret. Comput. Sci. 12 (1980), 291–302.
Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing, J. Automated Reasoning 30(1) (2003), 1–31.
Tinelli, C. and Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures, Theoret. Comput. Sci. 290(1) (2003), 291–353.
Tinelli, C. and Zarba, C. G.: Combining non-stably infinite theories, in I. Dahn and L. Vigneron (eds.), First Order Theorem Proving, Electron. Notes in Theoret. Comput. Sci. 86.1, Elsevier, 2003.
Venn, J.: On the diagrammatic and mechanical representation of propositions and reasonings, The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 9(59) (1880), 1–18.
Zarba, C. G.: Combining lists with integers, in R. Goré, A. Leitsch and T. Nipkow (eds.), Automated Reasoning: Short Papers, Technical Report DII 11/01, Università di Siena, Italy, 2001, pp. 170–179.
Zarba, C. G.: Combining multisets with integers, in A. Voronkov (ed.), Automated Deduction – CADE-18, Lecture Notes in Comput. Sci. 2392, Springer, 2002, pp. 363–376.
Zarba, C. G.: Combining sets with integers, in A. Armando (ed.), Frontiers of Combining Systems, Lecture Notes in Comput. Sci. 2309, Springer, 2002, pp. 103–116.
Zarba, C. G.: C-tableaux, Technical Report RR-5229, INRIA, 2004.
Zarba, C. G.: Combining sets with elements, in N. Dershowitz (ed.), Verification: Theory and Practice, Lecture Notes in Comput. Sci. 2772, Springer, 2004, pp. 762–782.
Zarba, C. G.: A quantifier elimination algorithm for a fragment of set theory involving the cardinality operator, in M. Kohlhase (ed.), 18th International Workshop on Unification, 2004.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zarba, C.G. Combining Sets with Cardinals. J Autom Reasoning 34, 1–29 (2005). https://doi.org/10.1007/s10817-005-3075-8
Issue Date:
DOI: https://doi.org/10.1007/s10817-005-3075-8