Abstract: We study the existence of Hanf normal forms for extensions FO(Q) of first-order logic by sets Q ⊆ P(ℕ) of unary counting quantifiers. A formula is in Hanf normal form if it is a Boolean ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback