Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

18th Annual IEEE Symposium on Logic in Computer Science (LICS'03)   p. 148
Successor-Invariance in the Finite

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2003.1210054
Send link to a friend

Abstract
A first-order sentence \theta of vocabulary \sigma \cup {S} is successor-invariant in the finite if for every finite \sigma-structure M and successor relations S1 and S2 on M, (M,S1) \models \theta \iff (M, S2) \models \theta. In this paper I give an example of a non-first-order definable class of finite structures which is, however, defined by a successor-invariant first-order sentence. This strengthens a corresponding result for order-invariance in the finite, due to Y. Gurevich.
Additional Information

Citation:  Benjamin Rossman, "Successor-Invariance in the Finite," lics, p. 148,  18th Annual IEEE Symposium on Logic in Computer Science (LICS'03),  2003

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback