The constructible universe

the ‘universe’ of constructible sets was introduced by Kurt Gödel in order to prove the consistency of the axiom of choice (AC) and the continuum hypothesis (CH) with the basic (ZF) axioms of set theory. The hypothesis that all sets are constructible is the axiom of constructibility (V = L). Gödel showed that if ZF is consistent, then ZF + V = L is consistent, and that AC and CH are provable in ZF + V = L.

THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS

The use of Extended Logics to replace ordinary second order definability in Kleene’s Ramified Analytical Hierarchy is investigated. This mirrors a similar investigation of Kennedy, Magidor and Väänänen [11] where Gödel’s universe L of constructible sets is subjected to similar variance. Enhancing second order definability allows models to be defined which may or may not coincide with the original Kleene hierarchy in domain. Extending the logic with game quantifiers, and assuming strong axioms of infinity, we obtain minimal correct models of analysis. A wide spectrum of models can be so generated from abstract definability notions: one may take an abstract Spector Class and extract an extended logic for it. The resultant structure is then a minimal model of the given kind of definability.

Fonctions régulues

Nous étudions l’anneau des fonctions rationnelles qui se prolongent par continuité surWe study the ring of rational functions admitting a continuous extension to the real affine space. We establish several properties of this ring. In particular, we prove a strong Nullstellensatz. We study the scheme theoretic properties and prove regulous versions of Theorems A and B of Cartan. We also give a geometrical characterization of prime ideals of this ring in terms of their zero-locus and relate them to euclidean closed Zariski-constructible sets.

The model completion of the theory of modules over finitely generated commutative algebras

We find the model completion of the theory modules over , where is a finitely generated commutative algebra over a field K. This is done in a context where the field K and the module are represented by sorts in the theory, so that constructible sets associated with a module can be interpreted in this language. The language is expanded by additional sorts for the Grassmanians of all powers of Kn, which are necessary to achieve quantifier elimination.The result turns out to be that the model completion is the theory of a certain class of “big” injective modules. In particular, it is shown that the class of injective modules is itself elementary. We also obtain an explicit description of the types in this theory.