Quantifier rank for parity of embedded finite models
✍ Scribed by Hervé Fournier
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 198 KB
- Volume
- 295
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
We are interested in the quantiÿer rank necessary to express the parity of an embedded set of cardinal smaller than a given bound. We consider several embedding structures such as the reals with addition and order, or the ÿeld of complex numbers. We provide both lower and upper bounds. We obtain from these results some bounds on the quantiÿer rank needed to express the connectivity of an embedded graph, when a bound on its number of vertices is given.
📜 SIMILAR VOLUMES
In this paper we prove the following theorem: THEOREM 1.5. Let G be an infinite, simple, K \*-group of finite Morley rank with a strongly embedded subgroup M. Assume that the Sylow 2-subgroups of G ha¨e infinitely many commuting in¨olutions. Then M is sol¨able. Ž . If, in addition, G is tame, then
We improve so-called "naive" and "mirror" models for the positive and negative parity nucleons, N and N\*, by introducing non-linear terms allowed by chiral symmetry. Both models in this improvement reproduce the observed nucleon axial charge in free space and reveal interesting density dependence o