On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

52Cr spinor condensate: a biaxial or uniaxial spin nematic

We show that the newly discovered 52Cr Bose condensate in zero magnetic field can be a spin nematic of the following kind: a "maximum" polar state, a "colinear" polar state, or a biaxial nematic ferromagnetic state. We also present the phase diagram with a magnetic field in the interaction subspace containing the chromium condensate. It contains many uniaxial and biaxial spin nematic phases, which often but not always break time reversal symmetry, and can exist with or without spontaneous magnetization.     

Investigation of the quantitative properties of the quadrupole orthogonal acceleration time-of-flight mass spectrometer with electrospray ionisation using 3,4-methylenedioxymethamphetamine

This paper describes the investigation of the potential of a quadrupole orthogonal acceleration time-of-flight mass spectrometer (Q-TOF) equipped with an atmospheric pressure ionisation interface for quantitative measurements of small molecules separated by reversed phase liquid chromatography. To this end, the detection limits and linear dynamic range in particular were studied in an LC/MS/MS experiment using 3,4-methylenedioxymethamphetamine standards and 3,4-methylenedioxyethylamphetamine for internal standardisation. In a second phase, the experiment was repeated with real biological extracts (whole blood, serum, and vitreous humour). A calibration for 3,4-methylenedioxymethamphetamine and its metabolite 3,4-methylenedioxyamphetamine was prepared in each of these matrices again using 3,4-methylenedioxyethylamphetamine as internal standard. The resulting quantitative data were compared with those obtained by liquid chromatography with fluorescence detection for the same extracts. The Q-TOF results revealed excellent sensitivity and a linear dynamic range of nearly four decades (2-10 000 pg on-column, r(2) = 0.9998, 1/x weighting). Furthermore, all the calibration curves prepared in biological material were superimposable, LC/MS/MS and LC-fluorescence, and the quantitative results for actual samples compared very favourably. It was concluded that the Q-TOF achieves a linear dynamic range for quantitative LC/MS/MS work exceeding that of fluorescence detection and at much better absolute sensitivity. Copyright 1999 John Wiley & Sons, Ltd.     

On the predecessor relation in abstract algebras

In this paper we generalize the Dedekind theory of order for the natural numbers N to abstract algebras with arbitrarily many finitary or infinitary operations. For any algebra ??, we introduce an algebraic predecessor relation P?? and its transitive hull P*?? coinciding in N with the unary injective successor function' resp. the >-relation. For some important classes of algebras ??, including Peano algebras (absolutely free algebras, word algebras), the algebraic predecessor relation is well-founded. Hence, its transitive hull, the natural ordering >?? of ??, is a well-founded partial order, which turns out to be a convenient device for classifying Peano algebras with respect to the number of operations and their arities. Moreover, the property of well-foundedness is an efficient tool for giving simple proofs of structure theorems as, e. g., that the class of all Peano algebras is closed under subalgebras and non-void direct products. - Finally, we will show how in the case of a formal language ??, i. e., the Peano algebra ?? of expressions (= terms & formulas), relations P??, resp. P*_?? can be used to define basic syntactical notions as occurences of free and bound variables etc. without any reference to a particular representation (“coding”) of the formal language. MSC: 03B22, 03E30, 03E75, 03F35, 08A55, 08B20.