References

1. S. Abiteboul, R. Hull & V. Vianu (1995): Foundations of Databases. Addison-Wesley.
2. A. Avron (2003): Transitive closure and the mechanization of mathematics, pp. 149–171, Applied Logics 28. Kluwer Academic Publishers.
3. A. Avron (2004): Safety signatures for first-order languages and their applications. In: Hendricks et al.: In First-Order Logic Revisited. Logos Verlag, pp. 37–58.
4. A. Avron (2008): Constructibility and decidability versus domain independence and absoluteness. Theoretical Computer Science 394, pp. 144–158, doi:10.1016/j.tcs.2007.12.008.
5. A. Avron (2008): A Framework for Formalizing Set Theories Based on the Use of Static Set Terms. In: Pillars of Computer Science, Lecture Notes in Computer Science 4800. Springer, pp. 87–106, doi:10.1007/978-3-540-78127-1_6.
6. A. Avron (2010): A new approach to predicative set theory. Ways of Proof Theory, pp. 31–63.
7. A. Fraenkel Y. Bar-Hillel & A. Levy (1973): Foundations of Set Theory, second edition, Studies in Logic and the Foundations of Mathematics 67. Elsevier, Amsterdam.
8. D. Cantone, E. Omodeo & A. Policriti (2001): Set Theory for Computing: From Decisions Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer.
9. K. J. Devlin (1984): Constructibility 6. Springer-Verlag.
10. R. O. Gandy (1974): Set-theoretic functions for elementary syntax: in Proceedings of Symposia in Pure Mathematics. In: Axiomatic set theory, Part 2. AMS, Providence, Rhode Island, pp. 103–126.
11. K. Gödel (1940): The Consistency of the Axion of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory 3. Princeton University Press, Princeton, N.J..
12. R. B. Jensen (1972): The fine structure of the constructible hierarchy. Annals of Mathematical Logic 4, pp. 229–308.
13. K. Kunen (1980): Set Theory: an Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics 102. Elsevier, Amsterdam.
14. J. Myhill (1952): A derivation of number theory from ancestral theory. Journal of Symbolic Logic 17, pp. 292–297.
15. V. Y. Sazonov (1997): On bounded set theory. In: Proceedings of the 10th International Congress on Logic, Methodology and Philosophy of Sciences I: Logic and Scientific Method. Kluwer Academic Publishers, Florence, pp. 85–103.
16. J. R. Shoenfield (1967): Mathematical Logic. Addison-Wesley.
17. R. M. Smullyan (1992): The Incompleteness Theorems. Oxford University Press.
18. J. D. Ullman (1998): Principles of database and knowledge-base systems. Computer Science Press.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org