Some aspects of model theory and finite structures

Bulletin of Symbolic Logic

Volumn 8, Issue 3, 2002, Pages 380-403

  Rosen, Eric ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036744383     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1182353894     Document Type: Article

References (73)

1. M. Ajtai and Y Gurevich, Monotone versus positive, Journal of the ACM, vol. 34 (1987), pp. 1004-1015.
2. M. Ajtai and Y Gurevich, Datalog vs first-order logic, Journal of Computer and System Sciences, vol. 49 (1994), pp. 562-58.
3. N. Alechina and Y Gurevich, Syntax vs. semantics on finite structures, Structures in logic and computer science. A selection of essays in honor of A. Ehrenfeucht (J. Mycielski, G. Rozenberg, and A. Salomaa, editors), LNCS, vol. 1261, Springer-Verlag, 1997, pp. 14-33.
4. H. Andreka, J. van Benthem, and I. Nemeti, Modal languages and boundedfragments of predicate logic, 1996, ILLC Research Report ML-96-03
5. J. T. Baldwin, Theories in finite model theory, 1999, preprint.
6. n -theories, Archive for Mathematical Logic, vol. 41 (2002), pp. 155-167.
7. J. T. Baldwin and S. Shelah, Randomness and semigenericity, Transactions of the American Mathematical Society, vol. 349 (1997), pp. 1359-1376.
8. J. T. Baldwin and N. Shi, Stable generic structures, Annals of Pure and Applied Logic, vol. 79 (1996), pp. 1-35.
9. R. Barker, A proof that there is no recursive link between the k-size of a model and its cardinality, 2000, preprint.
10. J. van Benthem, Modal logic and classical logic, Bibliopolis, 1983.
11. G. Birkhoff, On the structure of abstract algebras, Proc. Camb. Phil. Soc., vol. 31 (1935), pp. 433-454.
12. E. Borger, E. GrAdel, and Y Gurevich, The classical decision problem, SpringerVerlag, 1997.
13. C. C. Chang and H. J. Keisler, Model theory, 3rd ed., North-Holland, 1990.
14. Z. Chatzidakis, Model theory offinite fields and pseudo-finite fields, Annals of Pure and Applied Logic, vol. 88 (1997), pp. 95-108.
15. Z. Chatzidakis, L. van den Dries, and A. Macintyre, Definable sets over finite fields, Journal fur die Reine und Angewandte Mathematik, vol. 427 (1992), pp. 107-135.
16. G. Cherlin, Theories categorical in power n +2, Discrete Mathematics, to appear.
17. Z. Chatzidakis, L. van den Dries, and A. Macintyre, Large finite structures with few types, Algebraic model theory (B. T. Hart, A. H. Lachlan, and M. A. Valeriote, editors), Kluwer Academic Publishers, 1997, pp. 53105.
18. Z. Chatzidakis, L. van den Dries, and A. Macintyre, Sporadic homogeneous structures, The Gelfand Mathematical Seminars, Birkhauser, 2000, pp. 15-48.
19. G. Cherlin and U. Felgner, Homogeneous finite groups, Journal of the London Mathematical Society (2), vol. 62 (2000), pp. 784-794.
20. 0-stable structures, Annals of Pure and Applied Logic, vol. 28 (1985), pp. 103-135.
21. K. Compton, Some useful preservation theorems, The Journal of Symbolic Logic, vol. 48 (1983), pp. 427-440.
22. A. Dawar, Types and indiscernibles in finite models, Logic Colloquium’95 (J. Makowsky and E. Ravve, editors), Springer-Verlag, 1998, pp. 51-65.
23. A. Dawar, S. Lindell, and S. Weinstein, Infinitary logic and inductive definability over finite structures, Information and Computation, vol. 119 (1994), pp. 160-175.
24. M. Djordjevic, Finite variable logic and homogeneous structures, 2000, preprint.
25. M. Djordjevic, Finite variable logic, stability and finite models, The Journal of Symbolic Logic, vol. 66 (2001), pp. 837-858.
26. H.-D. Ebbinghaus and J. Flum, Finite model theory, Springer-Verlag, 1995.
27. R. Fagin, Probabilities on finitemodels, The Journal of Symbolic Logic, vol. 41 (1976), pp. 50-58.
28. U. Felgner, Pseudo-endliche Gruppen, Seminarber., Humboldt-Univ. Berlin, Sekt. Math., vol. 110 (1990), pp. 82-96.
29. A. Gardiner, Homogeneous graphs, Journal of Combinatorial Theory. Series B., vol. 20 (1976), pp. 94-102.
30. Ju. V Glebskii, D. I. Kogan, M. I. Liogonkii, and V. A. Talanov, Volume and fraction of satisfiability offormulas of the lower predicate calculus, Kibernetika (Kiev), vol. 2 (1969), pp. 17-27, (Russian).
31. E. GrAdel and G. McColm, Hierarchies in transitive closure logic, stratified Datalog and infinitary logic, Annals of Pure and Applied Logic, vol. 77 (1996), pp. 166-199.
32. E. GrAdel and E. Rosen, On preservation theorems for two-variable logic, Mathematical Logic Quarterly, vol. 45 (1999), pp. 315-325.
33. M. Grohe, Existential least fixed-point logic and its relatives, Journal of Logic and Computation, vol. 7 (1997), pp. 205-228.
34. M. Grohe, Finite variable logics in descriptive complexity theory, this Bulletin, vol. 4 (1998), pp. 345-398.
35. Y Gurevich, Toward logic tailored for computational complexity, Computation and proof theory (M. M. Richter et al., editors), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, 1984, pp. 175-216.
36. B. Herwig, Extending partial isomorphisms on finite structures, Combinatorica, vol. 115 (1995), pp. 365-371.
37. B. Herwig, Extending partial isomorphisms for the small index property of many w- categorical structures, Israel Journal of Mathematics, vol. 107 (1997), pp. 93-123.
38. B. Herwig and D. Lascar, Extending partial isomorphisms and the profinite topology on free groups, Transactions of the American Mathematical Society, vol. 352 (2000), pp. 1985-2021.
39. W. Hodges, Finite extensions and finite groups, Models and sets (Aachen, 1983) (G. H. Müller and M. M. Richter, editors), Lecture Notes in Mathematics, vol. 1103, Springer-Verlag, 1984, pp. 193-206.
40. W. Hodges, Model theory, Cambridge University Press, 1993.
41. W Hodges, I. Hodkinson, D. Lascar, and S. Shelah, The small index property for w-categorical w-stable structures andfor the random graph, Journal of the London Mathematical Society (2), vol. 48 (1993), pp. 204-218.
42. E. Hrushovski, Extending partial isomorphisms of graphs, Combinatorica, vol. 12 (1992), pp. 411-416.
43. 0-categorical pseudoplane, 1998, preprint.
44. T. Hyttinen, Forking in finite models, 1999, preprint.
45. T. Hyttinen, On stability in finite models, Archive for Mathematical Logic, vol. 39 (2000), pp. 89-102.
46. N. Immerman, Descriptive complexity, Springer-Verlag, 1998.
47. N. Immerman and D. Kozen, Definability with bounded number of bound variables, Information and Computation, vol. 83 (1989), pp. 121-139.
48. H. J. Keisler and W. Walkoe, Jr., The diversity of quantifier prefixes, The Journal of Symbolic Logic, vol. 38 (1973), pp. 79-85.
49. B. Kim and A. Pillay, From stability to simplicity, this Bulletin, vol. 4 (1998), pp. 17-36.
50. Ph. Kolaitis, Implicit definability on finite structures and unambiguous computations, Proceedings of 5th IEEE Symposium on Logic in Computer Science, 1990, pp. 168-180.
51. A. H. Lachlan, Homogeneous structures, Proceedings of the ICM1986 (A. Gleason, editor), American Mathematical Society, 1987, pp. 314-321.
52. A. H. Lachlan, Stable finitely homogeneous structures a survey, Algebraic model theory (B. T. Hart, A. H. Lachlan, and M. A. Valeriote, editors), Kluwer Academic Publishers, 1997, pp. 145-159.
53. A. H. Lachlan and A. Tripp, Finite homogeneous 3-graphs, Mathematical Logic Quarterly, vol. 41 (1995), pp. 287-306.
54. O. Lessmann, Simple theories in finite variable logic, 2000, preprint.
55. R. C. Lyndon, An interpolation theorem in the predicate calculus, Pacific Journal of Mathematics, vol. 9 (1959), pp. 129-142.
56. R. C. Lyndon, Properties preserved under homomorphism, Pacific Journal of Mathematics, vol. 9 (1959), pp. 143-154.
57. D. Macpherson, Finite axiomatizability and theories with trivial algebraic closure, Notre Dame Journal of Formal Logic, vol. 32 (1991), pp. 188-192.
58. n, The Journal of Symbolic Logic, vol. 47 (1982), pp. 641-658.
59. A. Robinson, Introduction to model theory and to the metamathematics of algebra, North-Holland, 1963.
60. E. Rosen, Finite model theory and finite variable logic, Ph.D. thesis, University of Pennsylvania, 1995.
61. E. Rosen, Modallogic over finite structures, Journal of Logic, Language and Information, vol. 6 (1997), pp. 427-439.
62. E. Rosen, On the first-order prefix hierarchy, 1998, preprint.
63. E. Rosen, S. SheLah, and S. Wernstern, k-universal graphs, Logic and random structures, American Mathematical Society, 1997, pp. 65-77.
64. E. Rosen and S. WeinsTein, Preservation theorems in finite model theory, Logic and computational complexity (D. Leivant, editor), LNCS, vol. 960, Springer-Verlag, 1995, pp. 480-502.
65. n, Annals of Pure and Applied Logic, vol. 40 (1988), pp. 11-28.
66. S. Shelah and J. Spencer, Zero-one laws for sparse random graphs, Journal of the American Mathematical Society, vol. 1 (1988), pp. 97-115.
67. J. Shoenfield, Mathematical logic, Addison-Wesley, 1967.
68. A. Stolboushkm, Finite monotone properties, Proceedings of 10th IEEE Symposium on Logic in Computer Science, 1995, pp. 324-330.
69. W. W. Tait, A counterexample to a conjecture of Scott and Suppes, The Journal of Symbolic Logic, vol. 24 (1959), pp. 15-16.
70. S. Thomas, Theories with finitely many models, The Journal of Symbolic Logic, vol. 51 (1986), pp. 374-376.
71. W. Walküe, Jr., Finite partially-ordered quantification, The Journal of Symbolic Logic, vol. 35 (1970), pp. 535-555.
72. J. S. Wilson, On simple pseudofinite groups, Journal of the London Mathematical Society (2), vol. 51 (1995), pp. 471-490.
73. B. Zilber, Totally categorical theories; structural properties and non-finite axiomatiz-ability, Proceedings: Model Theory of Algebra and Arithmetic (L. Pacholski et al., editors), 1979, pp. 381-410