Finite Queries Do Not Have Effective Syntax

Information and Computation

Volumn 153, Issue 1, 1999, Pages 99-116

  Stolboushkin, Alexei P ^a,b   Taitslin, Michael A ^c  

^a Fourth Dimension Software   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TVER STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002754510     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2792     Document Type: Article

References (19)

1. Ailamazian, A. K., Gilula, M. M., Stolboushkin, A. P., and Schwarz, G. F. (1986), Reduction of the relational model with infinite domains to the case of finite domains, Dokl. Akad. Nauk. SSSR 286(2), 308-311. [Russian; translation in Soviet Phys. Dokl. 31, 11-13]
2. Ailamazian, A. K., Gilula, M. M., Stolboushkin, A. P., and Schwarz, G. F. (1986), Reduction of the relational model with infinite domains to the case of finite domains, Dokl. Akad. Nauk. SSSR 286(2), 308-311. [Russian; translation in Soviet Phys. Dokl. 31, 11-13]
3. Avron, A., and Hirshfeld, J. (1991), On first order database query languages, in "Proc. 6th IEEE Symp. on Logic in Computer Science, 1991," pp. 226-231.
4. Codd, E. F. (1970), A relational model for large shared data banks, Comm. ACM 13, 377-387.
5. Codd, E. F. (1972), Relational completeness of data base sublanguages, in "Database Systems" (R. Rustin, Ed.), pp. 33-64, Prentice-Hall, Englewood Cliffs, NJ.
6. Di Paola, R. A. (1969), The recursive unsolvability of the decision problem for the class of definite formulas, J. Assoc. Comput. Mach. 16(2), 324-327.
7. Ershov, Yu. L., Lavrov, I. A., Taimanov, A. D., and Taitslin, M. A. (1965), Elementary theories, Russian Math. Surveys 20(4), 35-105.
8. Enderton, H. B. (1972), "A Mathematical Introduction to Logic," Academic Press, New York.
9. Gilula, M. M., Stolboushkin, A. P., Schwarz, G. F., and Shvachko, K. V. (1986), Some algorithmic problems in the theory of relational databases, in "Problem-Oriented Computational Systems, volume 125 of Problems in Cybernetics" (A. K. Ailamazian, Ed.), pp. 81-91, USSR Academy of Sciences, Moskow, USSR. [Russian]
10. Hirshfeld, J. (1991), Safe queries in relational databases with functions, in "CLS'91: 5th Workshop on Computer Science Logic, LNCS," pp. 173-183, Springer-Verlag.
11. Kifer, M. (1988), On safety, domain independence, and capturability of database queries, in "Proc. Third International Conference on Data and Knowledge Bases."
12. Kanellakis, P. C., Kuper, G. M., and Revesz, P. Z. (1990), Constraint query languages, in "Proc. 9th ACM Symp. on Principles of Database Systems," pp. 299-313.
13. Mal'cev, A. I. (1961), On elementary theories of locally free universal algebras, Doklady Akademii Nauk SSSR 138, 1009-1012. [Russian]
14. Mal'cev, A. I. (1962), Axiomatizable classes of locally free algebras of some types, Sibirsky Math. J. 3, 729-743. [Russian]
15. Rabin, M. O. (1977), Decidable theories, in "Handbook of Mathematical Logic" (J. Barwise, Ed.), Vol. 3, North-Holland, Amsterdam, New York, Oxford.
16. Ullman, J. D. (1982), "Principles of Database Systems," 2nd ed., Comput. Sci. Press, New York.
17. Ullman, J. D. (1988), "Principles of Database and Knowledge-Base Systems, Vol. I, II," Comput. Sci. Press, New York.
18. Van Gelder, A., and Topor, R. W. (June 1991), Safety and translation of relational calculus queries, ACM Trans. Database Systems 16(2), 235-278.
19. Vardi, M. Y. (1981), The decision problem for database dependencies, Information Processing Letters, 251-254.