This is a preview. Log in through your library . Abstract This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the ...
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 ...
We solve a problem of Friedman by showing the existence of a logic stronger than first-order logic even for countable models, but still satisfying the general compactness theorem, assuming e.g. the ...
The WFFs we have studied so far only capture logical statements of a very simple form. Very commonly we want to work with more complex statements, especially those that depend on some kind of ...
This software is still at an early development stage. Nevertheless, you are very welcome to use it already now. Any feedback is highly appreciated! Logic1 can be installed via Conda from the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results