Dénombrements relatifs à une définition combinatoire de la continuité sur un graphe
Dénombrements systématiques de relations binaires externes
Dense orderings, partitions and weak forms of choice
We investigate the relative consistency and independence of statements which imply the existence of various kinds of dense orders, including dense linear orders. We study as well the relationship between these statements and others involving partition properties. Since we work in ZF (i.e. without the Axiom of Choice), we also analyze the role that some weaker forms of AC play in this context
Densité et dimension
Une partie de est appelée une classe de Vapnik-Cervonenkis si la croissance de la fonction est polynomiale; ces classes se trouvent être utiles en Statistique et en Calcul des Probabilités (voir par exemple Vapnik, Cervonenkis [V.N. Vapnik, A.YA. Cervonenkis, Theor. Prob. Appl., 16 (1971), 264-280], Dudley [R.M. Dudley, Ann. of Prob., 6 (1978), 899-929]).Le présent travail est un essai de synthèse sur les classes de Vapnik-Cervonenkis. Mais il contient aussi beaucoup de résultats nouveaux,...
Dependences between definitions of finiteness
Dependences between definitions of finiteness. II
Der Beweis eines Satzes von G. Choodnovsky.
Derived operations in Goguen categories.
Descriptive Kakutani equivalence
Descriptive properties of density preserving autohomeomorphisms of the unit interval
We prove that density preserving homeomorphisms form a Π11-complete subset in the Polish space ℍ of all increasing autohomeomorphisms of unit interval.
Descriptive set theoretical complexity of randomness notions
We study the descriptive set theoretical complexity of various randomness notions.
Descriptive Set Theory and Infinitary Languages
Descriptive set-theoretical properties of an abstract density operator
Let (ℝ) stand for the hyperspace of all nonempty compact sets on the real line and let d ±(x;E) denote the (right- or left-hand) Lebesgue density of a measurable set E ⊂ ℝ at a point x∈ ℝ. In [3] it was proved that is ⊓11-complete. In this paper we define an abstract density operator ⅅ± and we generalize the above result. Some applications are included.
Destroying precaliber : an application of a Δ-systems lemma for closed sets
Determinacy of adversarial Gowers games
We prove a game-theoretic dichotomy for sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand, M. Davis’ proof of Σ⁰₃ determinacy.
Determinateness in the low protective hierarchy
Détermination des jeux boréliens et problèmes logiques associés
Deux relations dénombrables, logiquement équivalentes pour le second ordre, sont isomorphes
DFIS: A novel data filling approach for an incomplete soft set
The research on incomplete soft sets is an integral part of the research on soft sets and has been initiated recently. However, the existing approach for dealing with incomplete soft sets is only applicable to decision making and has low forecasting accuracy. In order to solve these problems, in this paper we propose a novel data filling approach for incomplete soft sets. The missing data are filled in terms of the association degree between the parameters when a stronger association exists between...
Diamond and λ-systems