Expressibility of first order logic with a nondeterministic inductive operator

1. Chandra, A., (1981) Programming Primitives for Database Languages, 8th Symposium on Principles of Programming Languages, ACM, pp 50–62.

   Google Scholar 

2. Chandra, A. and Harel, D., (1982) Structure and Complexity of Computable Queries, Journal of Comp. and System Sciences, 25, pp 99–128.

   Google Scholar 

3. Chandra, A. and Harel, D., (1982) Horn Clauses and the Fixpoint Query Hierarchy, Proc. ACM Symp. on Principles of Database Systems.

   Google Scholar 

4. Garey, M.R. and Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman.

   Google Scholar 

5. Gurevich, Y., (1984) Toward Logic Tailored for Computational Complexity, Proc. Logic Colloq. Aachen 1983, Lecture Notes in Mathematics, Vol. 1104, pp 175–216, Springer-Verlag.

   Google Scholar 

6. Gurevich, Y., (1985) Logic and the Challenge of Computer Science, Technical Report, University of Michigan, Computing Research Laboratory, CRL-TR-10-85.

   Google Scholar 

7. Immerman, N., (1982) Relational Queries Computable in Polynomial Time (Extended Abstract), 14th ACM Symp. on Theory of Computing, pp 147–152.

   Google Scholar 

8. Immerman, N., (1983) Languages which Capture Complexity Classes (Preliminary Report), 15th ACM Symp. on Theory of Computing, pp 347–354.

   Google Scholar 

9. Vardi, M.Y., (1982) The Complexity of Relational Query Languages (Extended Abstract), 14th ACM Symp. on Theory of Computing, pp 137–146.

   Google Scholar 

Download references