On finite rigid structures

Journal of Symbolic Logic

Volumn 61, Issue 2, 1996, Pages 549-562

  Gurevich, Yuri ^a   Shelah, Saharon ^b,c  

^a The Department of Civil and Environmental Engineering   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030538668     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275675     Document Type: Article

References (5)

1. ANUJ DAWAR, Feasible computation through model theory, Ph.D. thesis, Institute for Research in Cognitive Science University of Pennsylvania, Philadelphia, 1993.
2. YURI GUREVICH, Logic and the challenge of computer science, Current trends in theoretical computer science (E. Börger, editor), Computer Science Press, 1988, pp. 1-57.
3. NEIL IMMERMAN and E. S. LANDER, Describing graphs: A first-order approach to graph canonization, Complexity theory retrospective (Alan Selman, editor), Springer Verlag, 1990, pp. 59-81.
4. ALEXEI STOLBOUSHKIN, Axiomatizable classes of finite models and definability of linear order, Proceedings of the 7th IEEE Annual Symposium on Logic in Computer Science (1992), pp. 64-70.
5. SCOTT WEINSTEIN, private correspondence, October 1993.