An equational re-engineering of set theories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1761 LNAI, Issue , 2000, Pages 175-190

  Formisano, Andrea ^a   Omodeo, Eugenio ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Algebraic logic; First order theorem proving; Relation algebras; Set theory

Indexed keywords

ALGEBRA; CALCULATIONS; SET THEORY;

ALGEBRAIC LOGIC; FIRST ORDER THEOREM PROVING; MAP CALCULUS; RELATION ALGEBRAS; STATE OF THE ART; THEOREM PROVERS;

THEOREM PROVING;

EID: 84867828544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46508-1_12     Document Type: Conference Paper

References (37)

1. P. B. Andrews, D. Miller, E. Longini Cohen, and F. Pfenning. Automating higher-order logic. In W. W. Bledsoe and D. W. Loveland eds., Automated theorem proving: After 25 years, 169-192. American Mathematical Society, Contemporary Mathematics vol.29, 1984.
2. S. C. Bailin and D. Barker-Plummer. Z-match: An inference rule for incrementally elaborating set instantiations. J. Automated Reasoning, 11(3):391-428, 1993.
3. (Errata in J. Automated Reasoning, 12(3):411-412, 1994).
4. J. G. F. Belinfante. On a modification of Gödel's algorithm for class formation. AAR Newsletter No.34, 10-15, 1996.
5. R. Boyer, E. Lusk, W. McCune, R. Overbeek, M. Stickel, and L. Wos. Set theory in first-order logic: Clauses for Gödel's axioms. J. Automated Reasoning, 2(3):287-327, 1986.
6. +. In M. P. Bonacina and U. Furbach, eds., Proc. of the FTP97 International workshop on first-order theorem proving, RISC-Linz Report Series No.97-50, pp. 45-52, 1997.
7. D. Cantone, A. Ferro, and E. G. Omodeo. Computable set theory. Vol. 1. Int. Series of Monographs on Computer Science. Oxford University Press, 1989.
8. P. J. Cohen. Set Theory and the continuum hypothesis. Benjamin, New York, 1966.
9. I. Düntsch. Rough relation algebras. Fundamenta Informaticae, 21:321-331, 1994.
10. A. Formisano, E. G. Omodeo, and M. Temperini. Plan of activities on the map calculus. In J. L. Freire-Nistal, M. Falaschi, and M. Vilares Ferro, eds., Proc. of the AGP98 Joint Conference on Declarative Programming, pp. 343-356, A Coruña, Spain, 1998.
11. M. F. Frias, A. M. Haeberer, and P. A. S. Veloso. A finite axiomatization for fork algebras. J. of the IGPL, 5(3):311-319, 1997.
12. S. R. Givant. The Structure of Relation Algebras Generated by Relativization, volume 156 of Contemporary Mathematics. American Mathematical Society, 1994.
13. D. Gries and F. B. Schneider. A logical approach to discrete math. Textsand Monographs in Computer Science. Springer-Verlag, 1994.
14. A. M. Haeberer, G. A. Baum, and G. Schmidt. On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers. In Proc. of the International Conference on Formal Methods in Programming and their Applications. LNCS 735:281-298. Springer-Verlag, 1993.
15. T. J. Jech Set theory, Academic Press, New York, 1978.
16. B. Jónsson and A. Tarski. Representation problems for relation algebras. Bull. Amer. Math. Soc., 54, 1948;
17. J.-L. Krivine Introduction to axiomatic set theory, Reidel, Dordrecht. Holland, 1971.
18. R. C. Lyndon The representation of relational algebras. Annals of Mathematics, 51(3):707-729, 1950.
19. W. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, 1994. (Revision A, august 1995).
20. Ph. A. J. Noël. Experimenting with Isabelle in ZF set theory. J. Automated Reasoning, 10(1):15-58, 1993.
21. E. G. Omodeo and A. Policriti. Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case. Comm. Pure App. Math., 48(9-10):1123-1155, 1995. Special Issue in honor of J.T. Schwartz.
22. E. Orlowska. Relational semantics for nonclassical logics: Formulas are relations. In Wolenski, J. ed. Philosophical Logic in Poland, pages 167-186, 1994.
23. F. Parlamento and A. Policriti. Expressing infinity without foundation. J. Symbolic Logic, 56(4):1230-1235, 1991.
24. L. C. Paulson. Set Theory for verification: I. From foundations to functions. J. Automated Reasoning, 11(3):353-389, 1993.
25. L. C. Paulson. Set Theory for verification. II: Induction and recursion. J. Automated Reasoning, 15(2):167-215, 1995.
26. L. C. Paulson and K. Gra̧bczewski. Mechanizing set theory. J. Automated Reasoning, 17(3):291-323, 1996.
27. A. Quaife. Automated deduction in von Neumann-Bernays-Gödel Set Theory. J. Automated Reasoning, 8(1):91-147, 1992.
28. A. Quaife. Automated development of fundamental mathematical theories. Kluwer Academic Publishers, 1992.
29. rd printing, 1971.
30. G. Schmidt and T. Ströhlein. Relation algebras: concepts of points and representability. Discrete Mathematics, 54:83-92, 1985.
31. J. R. Shoenfield. Mathematical logic. Addison Wesley, 1967.
32. A. Tarski. Sur les ensembles fini. Fundamenta Mathematicae, 6:45-95, 1924.
33. A. Tarski. On the calculus of relations. Journal of Symbolic Logic, 6(3):73-89, 1941.
34. A. Tarski and S. Givant. A formalization of set theory without variables, volume 41 of Colloquium Publications. American Mathematical Society, 1987.
35. L. Wos. Automated reasoning. 33 basic research problems. Prentice Hall, 1988.
36. L. Wos. The problem of finding an inference rule for set theory. J. Automated Reasoning, 5(1):93-95, 1989.
37. E. Zermelo. Untersuchungen über die Grundlagen der Mengenlehre I. In Fro m Frege to Gödel - A source book in Mathematical Logic, 1879-1931, pages 199-215. Harvard University Press, 1977.