Completeness results for recursive data bases

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 522-536

  Hirst, Tirza ^a   Harel, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; GRAPH THEORY; QUERY LANGUAGES; RECURSIVE FUNCTIONS; THEOREM PROVING; TURING MACHINES;

COMPLETENESS; RECURSIVE DATABASE SYSTEMS; RECURSIVE GRAPHS;

RELATIONAL DATABASE SYSTEMS;

EID: 0030165910     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0039     Document Type: Article

References (20)

1. S. Abiteboul and V. Vianu, Generic computation and its complexity, in "Proc. 23rd ACM Symposium on Theory of Computing," pp. 209-219, ACM Press, New York, 1991.
2. F. Bancilhon, On the completeness of query languages for relational data bases, in "Proc. 7th Symposium on Math. Foundations of Computer Science, Zakophane, Poland," Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York/ Heidelberg, 1978.
3. D. R. Bean, Effective coloration, J. Symbolic Logic 41 (1976), 469-480.
4. D. R. Bean, Recursive Euler and Hamiltonian paths, Proc. Amer. Math. Soc. 55 (1976), 385-394.
5. R. Beigel and W. I. Gasarch, On the complexity of finding the chromatic number of a recursive graph, I & II, Ann. Pure Appl. Logic 45 (1989), 1-38, 227-247.
6. A. K. Candra and D. Harel, Computable queries for relational data bases, J. Comput. Systems Sci. 21 (1980), 156-178.
7. C. C. Chang and H. J. Keisler, "Model Theory," 3rd ed., North-Holland, Amsterdam, 1990.
8. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961), 129-141.
9. R. Fagin, Probabilities on finite models, J. Symbolic Logic 41 (1976), 50-58.
10. R. Fraisse, "Cours de Logique Mathématique," Gauthier-Villars/ Nauwelaerts, 1967.
11. D. Harel, Hamiltonian paths in infinite graphs, Israel J. Math. 76 (1991), 317-336; also, in "Proc. 23rd ACM Symposium on Theory of Computing, New Orleans," pp. 220-229, ACM, New York, 1991.
12. D. Harel, Hamiltonian paths in infinite graphs, Israel J. Math. 76 (1991), 317-336; also, in "Proc. 23rd ACM Symposium on Theory of Computing, New Orleans," pp. 220-229, ACM, New York, 1991.
13. T. Hirst and D. Harel, Taking it to the limit: On infinite variants of NP-complete problems, J. Comput. System Sci., to appear; also in "Proc. 8th IEEE Conference on Structure in Complexity Theory," IEEE Press, New York, 1993.
14. T. Hirst and D. Harel, Taking it to the limit: On infinite variants of NP-complete problems, J. Comput. System Sci., to appear; also in "Proc. 8th IEEE Conference on Structure in Complexity Theory," IEEE Press, New York, 1993.
15. T. Hirst and D. Harel, More about recursive structures: Descriptive complexity and zero-one laws, in "Proceedings, 11th Sympos. on Logic in Computer Science," IEEE Press, New York, to appear.
16. R. Hull and C. K. Yap, The format model: A theory of database organization, J. Assoc. Comput. Machin. 31 (1984), 518-537.
17. A. S. Morozov, Functional trees and automorphisms of models, Algebra and Logic 32 (1993), 28-38.
18. A Nerode and J. Remmel, A survey of lattices of R. E. substructures, in "Recursion Theory" (A. Nerode and R. A. Shore, Eds.), Proc. Symposa in Pure Math., Vol. 42, pp. 323-375, Amer. Math. Soc., Providence, RI, 1985.
19. J. Paredaens, On the expressive power of the relational algebra, Inform. Process. Lett. 7 (1978), 107-111.
20. R. Rado, Universal graphs and universal functions, Acta Arith. 9 (1964), 331-340.