If X, Y are universes of discourse, a fuzzy mapping f: X --> Y is defined as a classical mapping f: X x [0,1] --> P(Y). Their basic properties are studied as well as their relations with the classical model of fuzzy mapping.

We propose a "natural" axiomatic theory of the Foundations of Mathematics (Theory Q) where, in addition to the membership relation (between elements and classes), pairs, sets, natural numbers, n-tuples and operations are also introduced as primitives by means of suitable ground classes. Moreover, the theory Q allows an easy introduction of other mathematical and logical entities. The theory Q is finitely axiomatized in § 2, using a first-order language with a binary relation $\in$ (membership) and five...

The aim of this paper is to review the different operators defined in the Theory of Evidence. All of them are presented from the same point of view. Special attention is given to the logical operators: conjunction (Dempster's Rule), disjunction and negation (defined by Dubois and Prade), and the operators changing the level of granularity on the set of possible states (partitions, fuzzy partitions, etc.).

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures $(2^{\kappa },{\left[2^{\kappa }\right]}^{>\kappa },<)$, $(2^{\lambda },{\left[2^{\lambda }\right]}^{>\lambda },<)$ are indistinguishable...

We formulate a Covering Property Axiom $CP{A}_{cube}^{game}$, which holds in the iterated perfect set model, and show that it implies the existence of uncountable strong γ-sets in ℝ (which are strongly meager) as well as uncountable γ-sets in ℝ which are not strongly meager. These sets must be of cardinality ω₁ < , since every γ-set is universally null, while $CP{A}_{cube}^{game}$ implies that every universally null has cardinality less than = ω₂. We also show that $CP{A}_{cube}^{game}$ implies the existence of a partition of ℝ into ω₁ null compact sets....

We prove that for every countable ordinal $\alpha$ one cannot decide whether a given infinitary rational relation is in the Borel class ${\Sigma }_{\alpha }^{\mathbf{0}}$ (respectively ${\Pi }_{\alpha }^{\mathbf{0}}$). Furthermore one cannot decide whether a given infinitary rational relation is a Borel set or a ${\Sigma }_{\mathbf{1}}^{\mathbf{1}}$-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is an arithmetical set. We then deduce from the proof of these results some other ones, like: one cannot decide whether...

We prove that for every countable ordinal α one cannot decide whether a given infinitary rational relation is in the Borel class ${\Sigma }_{\alpha }^{\mathbf{0}}$ (respectively ${\Pi }_{\alpha }^{\mathbf{0}}$). Furthermore one cannot decide whether a given infinitary rational relation is a Borel set or a ${\Sigma }_{\mathbf{1}}^{\mathbf{1}}$-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is an arithmetical set. We then deduce from the proof of these results some other ones, like: one cannot decide...

We show that a set of reals is undetermined in Galvin's point-open game iff it is uncountable and has property C", which answers a question of Gruenhage.

Natural weakenings of uniformizability of a ladder system on ω₁ are considered. It is shown that even assuming CH all the properties may be distinct in a strong sense. In addition, these properties are studied in conjunction with other properties inconsistent with full uniformizability, which we call anti-uniformization properties. The most important conjunction considered is the uniformization property we call countable metacompactness and the anti-uniformization property we call thinness. The...

Galvin and Prikry defined completely Ramsey sets and showed that the class of completely Ramsey sets forms a σ-algebra containing open sets. However, they used two definitions of completely Ramsey. We show that they are not equivalent as they remarked. One of these definitions is a more uniform property than the other. We call it the uniformly completely Ramsey property. We show that some of the results of Ellentuck, Silver, Brown and Aniszczyk concerning completely Ramsey sets also hold for uniformly...

We investigate the question of whether or not an amenable subgroup of the permutation group on $\mathbb{N}$ can have a unique invariant mean on its action. We extend the work of M. Foreman (1994) and show that in the Cohen model such an amenable group with a unique invariant mean must fail to have slow growth rate and a certain weakened solvability condition.

Examples are presented of Σ₁¹-universal preorders arising by requiring the existence of particular surjective functions. These are: the relation of epimorphism between countable graphs; the relation of being a continuous image (or a continuous image of some specific kind) for continua; the relation of being continuous open image for dendrites.