Skip to main content Accessibility help
×
Home
Hostname: page-component-7f7b94f6bd-5bz6h Total loading time: 0.439 Render date: 2022-06-29T03:20:46.778Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

On finite rigid structures

Published online by Cambridge University Press:  12 March 2014

Yuri Gurevich
Affiliation:
Department of EECS, University of Michigan, Ann Arbor, Michigan 48109, USA, E-mail: gurevich@umich.edu
Saharon Shelah
Affiliation:
Department of Mathematics, Hebrew University, Jerusalem 91904, Israel Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA, E-mail: shelah@math.huji.ac.il

Abstract

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.

Type
Research Article
Copyright
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.)

References

[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.CrossRefGoogle 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
24
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On finite rigid structures
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

On finite rigid structures
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

On finite rigid structures
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *