Decidability results for sets with atoms

ACM Transactions on Computational Logic

Volumn 7, Issue 2, 2006, Pages 269-301

  Dovier, Agostino ^a   Formisano, Andrea ^b   Omodeo, Eugenio G ^b  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Prenex sentences; Quantifier elimination; Satisfiability problem; Set hyperset theories; Syllogistics; Unification

Indexed keywords

PRENEX SENTENCES; QUANTIFIER ELIMINATION; SATISFIABILITY PROBLEM; SET-HYPERSET THEORIES; SYLLOGISTICS; UNIFICATION;

ATOMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 33745227426     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1131313.1131317     Document Type: Article

References (49)

1. ACKERMANN, W. 1937. Die Widerspruchsfreiheit der allgemeinen Mengenlhere. Math. Annal. 114, 305-315.
2. ACZEL, P. 1988. Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14, Stanford.
3. BAADER, F. AND SCHULZ, K. U. 1998. Unification theory. In Automated Deduction - A Basis for Applications, vol. I:Foundations - Calculi and Methods, W. Bibel and P. H. Schmidt, eds. Applied Logic Series, vol. 8. Kluwer Academic, Dordrecht, 225-263.
4. BAADER, P. AND SNYDER, W. 2001. Unification theory. In Handbook of Automated Reasoning. A. Robinson and A. Voronkov, eds. Vol. I. Elsevier Science, Amsterdam, Chapter 8, 445-532.
5. BARWISE, J. AND Moss, L. 1996. Vicious Circles. CSLI Publication Notes, vol. 60, Stanford.
6. BELINFANTE, J. G. F. 1993. Studies in automated reasoning: SET-VAR. J. Autom. Reasoning 11, 293-314.
7. BELLE, D. AND PARLAMENTO, F. 1995. Decidability of the ∀*∃3*-class in the membership theory nwl. In Proceedings of Gödel'96-Logical Foundations of Mathematics, Computer Science and Physics-Kurt Gödel's Legacy. Lecture Notes in Logic, vol. 6. Springer Verlag, Berlin.
8. 20 states and beyond. Inf. Comput. 98, 2, 142-170.
9. CANTONE, D., GHELFO, S., AND OMODEO, E. G. 1988. The automation of syllogistic I. syllogistic normal forms. J. of Symb. Comput. 6, 1, 83-98.
10. CANTONE, D., OMODEO, E. G., AND POLICRITI, A. 1990. The automation of syllogistic II. Optimization and complexity issues. J. Autom. Reasoning 6, 2, 173-187.
11. CANTONE, D., OMODEO, E. G., AND POLICRITI, A. 2001. Set Theory for Computing-From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer Verlag, Berlin.
12. CANTONE, D., OMODEO, E. G., AND URSINO, P. 2002. Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators. Inf. Comput. 172, 165-201.
13. DOBERKAT, E. E. AND Fox, D. 1989. Software Prototyping mit SETL. Leitfaden und Monographien der Informatik. B. G. Teubner, Stuttgart.
14. DOVIER, A., OMODEO, E. G., AND POLICRITI, A. 1999. Solvable set/hyperset contexts: II. A goal-driven unification algorithm for the blended case. Appl. Algebra Engrg. Comm. Comput. 9, 4, 293-332.
15. DOVIER, A., OMODEO, E. G., PONTELLI, E., AND Rossi, G.-F. 1996. {log} : A language for programming in logic with finite sets. J. Logic Program. 28, 1, 1-44.
16. DOVIER, A., PIAZZA, C., PONTELLI, E., AND ROSSI, G.-F. 2000. Sets and constraint logic programming. ACM Trans. Program. Lang. Syst. 22, 5, 861-931.
17. DOVIER, A., PIAZZA, C., AND ROSSI, G.-F. 2001. Multiset rewriting by multiset constraint solving. Romanian J. Inf. Sci. Tech. 4, 1/2, 59-76.
18. DOVIER, A., POLICRITI, A., AND ROSSI, G.-F. 1998. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundam. Inf., 36, 2/3, 201-234.
19. ENDERTON, H. B. 1977. Elements of Set Theory. Academic Press, New York.
20. FARMER, W. M. 2001. STMM: A set theory for mechanized mathematics. J. Autom. Reasoning 26, 3, 269-289.
21. FORMISANO, A., OMODEO, E. G., AND TEMPERINI, M. 2001. Instructing equational set-reasoning with Otter. In Automated Reasoning. R. Gore, A. Leitsch, and T. Nipkow eds. Lecture Notes in Computer Science, vol. 2083. Springer Verlag, Berlin, 152-167.
22. n∃-completeness of Zermelo-Fraenkel set theory. Zeitschr. Math. Logik Grundlagen Math. 24, 4, 289-290.
23. GORDON, M. 1996. Set theory, higher order logic or both? In 9th International Conference on Theorem Proving in Higher Order Logics TPHOL. J. V. Wright, J. Grundy, and J. Harrison, eds. Lecture Notes in Computer Science, vol. 1125. Springer Verlag, Berlin, 191-202.
24. HILL, P. AND LLOYD, J. 1994. The Gödel Programming Language. MIT Press, Cambridge, MA.
25. JECH, T. 1978. Set Theory. Pure and Applied Mathematics - A Series of Monographs and Text-books, vol. 79. Academic Press, New York.
26. KELLER, J. P. AND PAIGE, R. 1995. Program derivation with verified transformations - A case study. Comm. Pure App. Math. 48, 9-10, 1053-1113.
27. LAMPORT, L. 2002. Specifying Systems - The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, New York.
28. LEVY, A. 1979. Basic Set Theory. Perspectives in Mathematical Logic. Springer Verlag, Berlin.
29. MEISELS, I. AND SAALTINK, M. 1996. The Z/EVES reference manual (for version 1.3). Tech. Rep. TR-96-5493-03b, ORA Canada.
30. MIZAR. Mizar Project Home Page, http://www.mizar.org.
31. NOËL, P. A. J. 1993. Experimenting with Isabelle in ZF set theory. J. Autom. Reasoning 10, 1, 15-58.
32. OMODEO, E. G., PARLAMENTO, F., AND POLICRITI, A. 1993. A derived algorithm for evaluating ε-expressions over abstract sets. J. Symb. Comput. 15, 673-704.
33. OMODEO, E. G., PARLAMENTO, F., AND POLICRITI, A. 1996. Decidability of ∀*∃-sentences in member-ship theories. Math. Logic Q. 42, 1, 41-58.
34. OMODEO, E. G. AND POLICRITI, A. 1995. Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case. Comm, Pure App. Math. 48, 9-10, 1123-1155. Special issue in honor of J. T. Schwartz.
35. PARLAMENTO, F., POLICRITI, A., AND RAO, K. P. S. B. 1997. Witnessing differences without redundancies. Proc. AMS 125, 2, 587-594.
36. PAULSON, L. C. 1995. Set theory for verification. II: Induction and recursion. J. Autom. Reasoning 15, 2, 167-215.
37. PAULSON, L. C. 1997. Generic automatic proof tools. In Automated Reasoning and Its Applications. R. Veroff., ed. MIT Press, Cambridge, MA, Chapter 3, 23-47.
38. PAULSON, L. C. AND GRA̧BCZEWSKI, K. 1996. Mechanizing set theory. J. Autom. Reasoning 17, 3, 291-323.
39. PĀUN, G. 2000. Computing with membranes. J. Comput. Syst. Sci. 61, 1, 108-143.
40. POLICRITI, A. AND SCHWARTZ, J. T. 1995. T-theorem proving. I. J. Symb. Comput. 20, 3, 315-342.
41. QUAIFE, A. 1992. Automated Development of Fundamental Mathematical Theories. Kluwer Academic, Dordrecht.
42. QUINE, W. V. 1971. Set Theory and its Logic. Harvard University Press, Cambridge, MA.
43. RASMUSSEN, O. 1995. A Ruby proof system. Tech. Rep. ID-TR-1995-161, Department of Computer Science, Technical University of Denmark.
44. RASMUSSEN, O. 1996. Ensuring correctness of Ruby transformations. In Proceedings of the 3rd Workshop on Designing Correct Circuits (DCC96). M. Sheeran and S. Singh, eds. Springer Verlag, Berlin.
45. SAALTINK, M. 1997. The Z/EVES system. In 11th International Conference of Z Users. Springer Verlag, Berlin. 72-85.
46. SCHWARTZ, J. T., DEWAR, R. K. B., DUBINSKY, E., AND SCHONBERG, E. 1986. Programming with Sets: An Introduction to SETL. Texts and Monographs in Computer Science. Springer Verlag, New York.
47. SETLOG. The {log} Project Home Page, http://www.math.unipr.it/~gianfr/ setlog.Home.html.
48. SETS. The Programming with {SETS} Home Page, http://www.cs.nmsu.edu/ ~complog/sets.
49. SICSTUS. Swedish Institute for Computer Science. Sicstus Prolog Home Page, http://www.sics.se/sicstus.