• DocumentCode
    2038792
  • Title

    Hypergraph Acyclicity and Extension Preservation Theorems

  • Author

    Duris, David

  • Author_Institution
    Equipe de Logique Math., Univ. Paris Diderot, Paris
  • fYear
    2008
  • fDate
    24-27 June 2008
  • Firstpage
    418
  • Lastpage
    427
  • Abstract
    A class of structures satisfies the extension preservation theorem if, on this class, every first order sentence is preserved under extension iff it is equivalent to an existential sentence. We consider different acyclicity notions for hypergraphs (gamma, beta and alpha-acyclicity and also acyclicity on hypergraph quotients) and estimate their influence on the validity of the extension preservation theorem on classes of finite structures. More precisely, we prove that gamma-acyclic classes satisfy the extension preservation theorem, whereas beta-acyclic classes do not. We also extend the validity of the extension preservation theorem for a generalization of gamma-acyclicity that we call gamma-acyclic k-quotient. To achieve this, we make a reduction from finite structures to their k-quotients and we use combinatorial arguments on gamma-acyclic hypergraphs.
  • Keywords
    graph theory; beta-acyclic class; extension preservation theorem; gamma-acyclic class; hypergraph acyclicity; Computer science; Databases; Logic; finite model theory; hypergraph acyclicity; logic; preservation theorems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2008. LICS '08. 23rd Annual IEEE Symposium on
  • Conference_Location
    Pittsburgh, PA
  • ISSN
    1043-6871
  • Print_ISBN
    978-0-7695-3183-0
  • Type

    conf

  • DOI
    10.1109/LICS.2008.12
  • Filename
    4557931