Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-20T16:11:36.809Z Has data issue: false hasContentIssue false

On finite rigid structures

Published online by Cambridge University Press:  12 March 2014

Yuri Gurevich
Department of EECS, University of Michigan, Ann Arbor, Michigan 48109, USA, E-mail:
Saharon Shelah
Department of Mathematics, Hebrew University, Jerusalem 91904, Israel Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA, E-mail:


The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no formula with counting quantifiers defines a linear order.

Research Article
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)



[1]Dawar, Anuj, Feasible computation through model theory, Ph.D. thesis, Institute for Research in Cognitive Science University of Pennsylvania, Philadelphia, 1993.Google Scholar
[2]Gurevich, Yuri, Logic and the challenge of computer science, Current trends in theoretical computer science (Börger, E., editor), Computer Science Press, 1988, pp. 157.Google Scholar
[3]Immerman, Neil and Lander, E. S., Describing graphs: A first-order approach to graph canonization, Complexity theory retrospective (Selman, Alan, editor), Springer Verlag, 1990, pp. 5981.Google Scholar
[4]Stolboushkin, Alexei, Axiomatizable classes of finite models and definability of linear order, Proceedings of the 7th IEEE Annual Symposium on Logic in Computer Science (1992), pp. 6470.Google Scholar
[5]Weinstein, Scott, private correspondence, 10 1993.Google Scholar