Hanf normal form for first-order logic with unary counting quantifiers
LICS, pp. 277-286, 2016.
We study the existence of Hanf normal forms for extensions FO(Q) of first-order logic by sets Q ⊆ P(N) of unary counting quantifiers. A formula is in Hanf normal form if it is a Boolean combination of formulas ζ(x) describing the isomorphism type of a local neighbourhood around its free variables x and statements of the form \"the number ...More
Full Text (Upload PDF)
PPT (Upload PPT)