• DocumentCode
    1615810
  • Title

    Successor-invariance in the finite

  • Author

    Rossman, Benjamin

  • fYear
    2003
  • Firstpage
    148
  • Lastpage
    157
  • Abstract
    A first-order sentence θ of vocabulary σ ∪ {S} is successor-invariant in the finite if for every finite σ-structure M and successor relations S1 and S2 on M, (M, S1) θ ⇔ (M, S2) θ. 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-invariant in the finite, due to Y. Gurevich.
  • Keywords
    formal logic; finite order-invariant; finite structure; finite successor-invariance; nonfirst-order definable class; sigma-structure; successor relation; successor-invariant first-order sentence; Computer science; Database languages; Interpolation; Logic; Presses; Relational databases; Vocabulary;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2003. Proceedings. 18th Annual IEEE Symposium on
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-1884-2
  • Type

    conf

  • DOI
    10.1109/LICS.2003.1210054
  • Filename
    1210054