Title :
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
Author_Institution :
Dept. of Math., Tech. Univ. Darmstadt, Darmstadt, Germany
Abstract :
We construct finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class, and only counts transitions between colour classes. These groups are shown to be useful in the construction of finite bisimilar hypergraph covers that avoid any small cyclic configurations. We present two applications to the finite model theory of the guarded fragment: a strengthening of the known finite model property for GF and the characterisation of GF as the guarded bisimulation invariant fragment of FO in the sense of finite model theory.
Keywords :
graph theory; group theory; Cayley graphs; acyclic groups; finite bisimilar hypergraph covers; finite model theory; guarded bisimulation invariant fragment; guarded fragment; Book reviews; Color; Construction industry; Generators; Length measurement; Merging; Zinc; acyclicity; finite model theory; guarded fragment; hypergraphs;
Conference_Titel :
Logic in Computer Science (LICS), 2010 25th Annual IEEE Symposium on
Conference_Location :
Edinburgh
Print_ISBN :
978-1-4244-7588-9
Electronic_ISBN :
1043-6871
DOI :
10.1109/LICS.2010.14