Padding and the Expressive Power of Existential Second-Order Logics

@inproceedings{Schwentick1997PaddingAT,
  title={Padding and the Expressive Power of Existential Second-Order Logics},
  author={Thomas Schwentick},
  booktitle={CSL},
  year={1997}
}
Padding techniques are well-known from Computational Complexity Theory. Here, an analogous concept is considered in the context of existential second-order logics. Informally, a graph H is a padded version of a graph G, if H consists of an isomorphic copy of G and some isolated vertices. A set A of graphs is called weakly expressible by a formula ' in the… CONTINUE READING