How to define a linear order on finite models

Annals of Pure and Applied Logic

Volumn 87, Issue 3, 1997, Pages 241-267

  Hella, Lauri ^b   Kolaitis, Phokion G ^a   Luosto, Kerkko ^b  

^a University of California Santa Cruz   (United States)

^b NONE

Author keywords

Computational complexity; Finite model theory; Fixpoint logic; Graph automorphism; Graph isomorphism; Implicit definability; Infinitary logic; Linear order; Rigid models

Indexed keywords

EID: 0031576314     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(97)00008-0     Document Type: Article

References (51)

1. [1] S. Abiteboul, V. Vianu, Datalog extensions for database queries and updates, J. Comput. System Sci. 43 (1) (1991) 62-124.
2. [2] S. Abiteboul, V. Vianu, Computing with first-order logic, J. Comput. Sys. Sci. 50 (2) (1995) 309-335. Special Issue: Selections from 23rd Ann. ACM Symp. on Theory of Computing, New Orleans, LA, USA, 6-8 May 1991.
3. [3] L. Babai, P. Erdös, S.M. Selkow, Random graph isomorphism, SIAM J. Comput. 9 (1980) 628-635.
4. [4] J. Barwise, On Moschovakis closure ordinals, J. Symbolic Logic 42 (1977) 292-296.
5. [5] J. Barwise, S. Feferman (Eds.) Model-Theoretic Logics, Springer, Berlin, 1985.
6. [6] J. Cai, M. Fürer, N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica 12 (1992) 389-410.
7. [7] A. Chandra, D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
8. [8] C.C. Chang, H.J. Keisler, Model Theory, 3rd ed., North-Holland, Amsterdam, 1990.
9. [9] A. Dawar, Feasible Computation Through Model Theory, Ph.D. Thesis, University of Pennsylvania, Philadelphia, 1993.
10. [10] A. Dawar, Generalized quantifiers and logical reducibilities, J. Logic Comput. 5 (2) (1995) 213-226.
11. [11] A. Dawar, L. Hella, P.G. Kolaitis, Implicit definability and infinitary logic in finite model theory, in: Z. Fulop, F. Gecseg (Eds.), Proc. 22nd Internat. Coll. on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, 1995, pp. 624-635.
12. [12] A. Dawar, S. Lindell, S. Weinstein, Infinitary logic and inductive definability over finite structures, Inform. and Comput. 119 (2) (1995) 160-175.
13. [13] M. de Rougemont, Second-order and inductive definability on finite structures, Z. Math. Logik Grundlagen Math. 33 (1987) 47-63.
14. [14] R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proc., vol. 7, 1974, pp. 43-73.
15. [15] R. Fagin, Probabilities on finite models, J. Symbolic Logic 41 (1976) 50-58.
16. [16] R. Fagin, The number of finite relational structures, Discrete Math. 19 (1977) 17-21.
17. [17] E. Grädel, M. Otto, Inductive definability with counting on finite structures, in: CSL'92: 6th Workshop on Computer Science Logic, Lecture Notes in Computer Science, vol. 702, Springer, Berlin, 1993, pp. 231-247.
18. [18] Y. Gurevich, Toward logic tailored for computational complexity, in: M.M. Richter et al. (Eds.), Computation and Proof Theory, Lecture Notes in Math., vol. 1104, Springer, Berlin, 1984, pp. 175-216.
19. [19] Y. Gurevich, Logic and the challenge of computer science, in: E. Börger, (Ed.), Current Trends in Theoretical Computer Science, Computer Science Press, Rockville, MD, 1988, pp. 1-57.
20. [20] Y. Gurevich, N. Immerman, S. Shelah, McColm's conjecture, in: Proc. 7th IEEE Symp. on Logic in Comp. Sci., 1994, pp. 10-19.
21. [21] J. Grollmann, A. Selman, Complexity measures for public key cryptosystems, SIAM J. Comput. 17 (1988) 309-335.
22. [22] Y. Gurevich, S. Shelah, Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986) 265-280.
23. [23] Y. Gurevich, S. Shelah, On finite rigid structures, J. Symbolic Logic 61 (2) (1996) 549-562.
24. [24] B.R. Heap, The production of a graph by computer, in: R. Read (Ed.), Graph Theory and Computing, Academic Press, New York, 1972, pp. 47-62.
25. [25] L. Hella, Logical hierarchies in PTIME, Inform. and Comput. 129 (1) (1996) 1-19.
26. [26] L. Hella, P.G. Kolaitis, K. Luosto, Almost everywhere equivalence of logics in finite model theory, Bull. Symbolic Logic 2 (4) (1996) 422-443.
27. [27] I. Hodkinson, Finite variable logics, Bull. European Assoc. Theoret. Comput. Sci. 51 (1993) 111-140.
28. [28] N. Immerman, Upper and lower bounds for first-order expressibility, J. Comput. System Sci. 25 (1982) 76-98.
29. [29] N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
30. [30] N. Immerman, Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
31. [31] N. Immerman, Descriptive and computational complexity, in: J. Hartmanis (Ed.), Computational Complexity Theory, Proc. Symp. Applied Math., vol. 38, American Mathematical Society, Providence, RI, 1989, pp. 75-91.
32. [32] N. Immerman, D. Kozen, Definability with bounded number of bound variables, Inform. and Comput. 83 (1989) 121-139.
33. [33] N. Immerman, E.S. Lander, Describing graphs: a first-order approach to graph canonization, in: A. Selman (Ed.), Complexity Theory Retrospective, Springer, Berlin, 1990, pp. 59-81.
34. [34] J. Köbler, U. Schöning, J. Torán, The Graph Isomorphism Problem, Birkhäuser, Basel, 1993.
35. [35] P.G. Kolaitis, On asymptotic probabilities of inductive queries and their decision problem, in: R. Parikh (Ed.), Logics of Programs '85, Lecture Notes in Computer Science, vol. 193, Springer, Berlin, 1985, pp. 153-166.
36. [36] P.G. Kolaitis, Implicit definability on finite structures and unambiguous computations, in: Proc. 5th IEEE Symp. on Logic in Computer Science, 1990, pp. 168-180.
37. [37] P.G. Kolaitis, M.Y. Vardi, On the expressive power of datalog: tools and a case study, J. Comput. System Sci. 51 (1) (1995) 110-134. Special issue: Selections from Ninth Annual ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Nashville, TN, USA, 2-4 April 1990.
38. [38] P.G. Kolaitis, M.Y. Vardi, Fixpoint logic vs. infinitary logic in finite-model theory, in: Proc. 7th IEEE Symp. on Logic in Computer Science, 1992, pp. 46-57.
39. [39] P.G. Kolaitis, M.Y. Vardi, Infinitary logic and 0-1 laws, Inform. and Comput. 98 (1992) 258-294.
40. [40] V.S. Lakshmanan, A.O. Mendelzon, Inductive pebble games and the expressive power of DATALOG, in: Proc. 8th ACM Symp. on Principles of Database Systems (1989) 301-310.
41. [41] D. Leivant, Descriptive characterization of computational complexity, J. Comput. System Sci. 39 (1989) 51-83.
42. [42] G.L. McColm, When is arithmetic possible? Ann. Pure Appl. Logic 50 (1990) 29-51.
43. [43] Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.
44. [44] M. Otto, The expressive power of fixed-point logic with counting, J. Symbolic Logic 61 (1) (1996) 147-176.
45. [45] G. Pólya, Kombinatorische anzahlbestimmungen für gruppen, graphen und chemische verbindungen, Acta Math. 68 (1937) 145-254.
46. [46] A. Seth, When do fixed point logics capture complexity classes? in: Proc. 10th IEEE Symp. on Logic in Computer Science, 1995, pp. 353-363.
47. [47] L.J. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 1-22.
48. [48] A. Stolboushkin, Axiomatizable classes of finite models and definability of linear order, in: Proc. 7th IEEE Symp. on Logic in Computer Science, 1992, pp. 64-70.
49. [49] J. van Leeuwen, Graph algorithms, in: Handbook of Theoretical Computer Science, vol. A, Ch. 10, The MIT Press/Elsevier, Cambridge/Amsterdam, 1990 pp. 525-631.
50. [50] L. Valiant, Relative complexity of checking and evaluating, Inform. Process. Lett. 5 (1976) 20-23.
51. [51] M.Y. Vardi, The complexity of relational query languages, in: Proc. 14th ACM Symp. on Theory of Computing, 1982, pp. 137-146.