An optimal construction of Hanf sentences
Logic in Computer Science
2011-06-07 v2 Logic
Abstract
We give the first elementary construction of equivalent formulas in Hanf normal form. The triply exponential upper bound is complemented by a matching lower bound.
Cite
@article{arxiv.1105.5487,
title = {An optimal construction of Hanf sentences},
author = {Benedikt Bollig and Dietrich Kuske},
journal= {arXiv preprint arXiv:1105.5487},
year = {2011}
}