Convergence and submeasures in Boolean algebras
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Fréchet.
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Fréchet.
We are inspired by the work of Henri Cartan [16], Bourbaki [10] (TG. I Filtres) and Claude Wagschal [34]. We define the base of filter, image filter, convergent filter bases, limit filter and the filter base of tails (fr: filtre des sections).
Assuming the continuum hypothesis, we show that (i) there is a compact convex subset L of , and a probability Radon measure on L which has no separable support; (ii) there is a Corson compact space K, and a convex weak*-compact set M of Radon probability measures on K which has no -points.
A subset of a vector space is called countably convex if it is a countable union of convex sets. Classification of countably convex subsets of topological vector spaces is addressed in this paper. An ordinal-valued rank function ϱ is introduced to measure the complexity of local nonconvexity points in subsets of topological vector spaces. Then ϱ is used to give a necessary and sufficient condition for countable convexity of closed sets. Theorem. Suppose that S is a closed subset of a Polish linear...
Given Polish spaces X and Y and a Borel set S ⊆ X × Y with countable sections, we describe the circumstances under which a Borel function f: S → ℝ is of the form f(x,y) = u(x) + v(y), where u: X → ℝ and v: Y → ℝ are Borel. This turns out to be a special case of the problem of determining whether a real-valued Borel cocycle on a countable Borel equivalence relation is a coboundary. We use several Glimm-Effros style dichotomies to give a solution to this problem in terms of certain σ-finite measures...
Answering a question of Kłopotowski, Nadkarni, Sarbadhikari, and Srivastava, we characterize the Borel sets S ⊆ X × Y with the property that every Borel function f: S → ℂ is of the form f(x,y) = u(x) + v(y), where u: X → ℂ and v: Y → ℂ are Borel.
The paper introduces coproducts in categories without uniqueness of cod and dom. It is proven that set-theoretical disjoint union is the coproduct in the category Ens [9].
La classe des constructibles de la géométrie algébrique est close par projection. La théorie des modèles exprime ce fait en disant que les corps algébriquement clos éliminent les quantificateurs dans le langage des anneaux. De façon analogue, les corps algébriquement clos non trivialement valués éliminent les quantificateurs dans le langage des anneaux enrichi de la relation dite de divisibilité . Cela implique en particulier la « -minimalité » : une partie définissable d’un corps algébriquement...
Corrección del artículo del autor "Anàlisi formalment recursiva", publicado en Publicacions de la Secció de Matemàtiques de la UAB, 30 (2-3), p. 35-75 (1986).