## Abstract Two theorems are proved: First that the statement “there exists a field __F__ such that for every vector space over __F__, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assert
The Size of Max(p) Sets and Density Bases
✍ Scribed by Kathryn E. Hare; Jan-Olav Rönning
- Publisher
- SP Birkhäuser Verlag Boston
- Year
- 2002
- Tongue
- English
- Weight
- 104 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1069-5869
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We show that the both assertions “in every vector space __B__ over a finite element field every subspace __V__ ⊆ __B__ has a complementary subspace __S__” and “for every family 𝒜 of disjoint odd sized sets there exists a subfamily ℱ={F~j~:j ϵω} with a choice function” together imply the
We exhibit some automorphism bases for the enumeration degrees, and we derive some consequences relative to the automorphisms of the enumeration degrees.
In this paper we consider two physically relevant numerical quantities (namely, the concurrence and -fidelity) and an operation (called ♦-product) defined on the set of all quantum states or density operators. Our main aim is to present the complete descriptions of all bijective transformations whic