A failure of quantifier elimination.
We show that log is needed to eliminate quantifiers in the theory of the real numbers with restricted analytic functions and exponentiation.
A graphical representation of relational formulae with complementation
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose...
A graphical representation of relational formulae with complementation∗
We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like...
A rigid Boolean algebra that admits the elimination of Q21
Using ♢ , we construct a rigid atomless Boolean algebra that has no uncountable antichain and that admits the elimination of the Malitz quantifier .
A viewpoint on amalgamation classes
We give a self-contained introduction to universal homogeneous models (also known as rich models) in a general context where the notion of morphism is taken as primitive. We produce an example of an amalgamation class where each connected component has a saturated rich model but the theory of the rich models is not model-complete.
Algorithmes d'élimination des quantificateurs
Analytic cell decomposition and analytic motivic integration