An optimal construction of Hanf sentences - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Applied Logic Year : 2012

An optimal construction of Hanf sentences


We give a new construction of formulas in Hanf normal form that are equivalent to first-order formulas over structures of bounded degree. This is the first algorithm whose running time is shown to be elementary. The triply exponential upper bound is complemented by a matching lower bound.


Logic [math.LO]

Dates and versions

hal-00776607 , version 1 (15-01-2013)



Benedikt Bollig, Dietrich Kuske. An optimal construction of Hanf sentences. Journal of Applied Logic, 2012, 10 (2), pp.179-186. ⟨10.1016/j.jal.2012.01.002⟩. ⟨hal-00776607⟩
116 View
0 Download



Gmail Facebook Twitter LinkedIn More