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 ...
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 ...
Cylindrical Algebraic Decomposition (CAD) is a pivotal algorithmic technique in real algebraic geometry, instrumental in resolving problems expressed in a first‐order language over the reals. By ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback