Many fundamental mathematical results fail in ZF, i.e., in Zermelo-Fraenkel set theory without the Axiom of Choice. This article surveys results — old and new — that specify how much “choice” is needed precisely to validate each of certain basic analytical and topological results.
Węglorz' models are models for set theory without the axiom of choice. Each one is determined by an atomic Boolean algebra. Here the algebraic properties of the Boolean algebra are compared to the set theoretic properties of the model.
In set theory without the axiom of choice (AC), we observe new relations of the following statements with weak choice principles. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is countable. If in a partially ordered set, all chains are finite and all antichains have size , then the set has size for any regular . Every partially ordered set without a maximal element has two disjoint cofinal sub sets – CS. Every partially ordered set...
We introduce, using the Mizar system [1], some basic concepts of Euclidean geometry: the half length and the midpoint of a segment, the perpendicular bisector of a segment, the medians (the cevians that join the vertices of a triangle to the midpoints of the opposite sides) of a triangle. We prove the existence and uniqueness of the circumcenter of a triangle (the intersection of the three perpendicular bisectors of the sides of the triangle). The extended law of sines and the formula of the radius...
By an equivalence system is meant a couple where is a non-void set and is an equivalence on . A mapping of an equivalence system into is called a class preserving mapping if for each . We will characterize class preserving mappings by means of permutability of with the equivalence induced by .
On cherche à donner une construction aussi simple que possible d'un borélien donné d'un produit de deux espaces polonais. D'où l'introduction de la notion de classe de Wadge potentielle. On étudie notamment ce que signifie "ne pas être potentiellement fermé", en montrant des résultats de type Hurewicz. Ceci nous amène naturellement à des théorèmes d'uniformisation partielle, sur des parties "grosses", au sens du cardinal ou de la catégorie.
Bounded commutative residuated lattice ordered monoids (-monoids) are a common generalization of -algebras and Heyting algebras, i.e. algebras of basic fuzzy logic and intuitionistic logic, respectively. In the paper we develop the theory of filters of bounded commutative -monoids.
The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (monoids) are common generalizations of -algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain information, sets of provable formulas in inference systems could be described by fuzzy filters of the corresponding...
Distortion of fuzzy measures is discussed. A special attention is paid to the preservation of submodularity and supermodularity, belief and plausibility. Full characterization of distortion functions preserving the mentioned properties of fuzzy measures is given.