Constructively Complete Finite Sets
โ Scribed by Mark Mandelkern
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 458 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
CONSTRUCTIVELY COMPLETE FINITE SETS $y MARK MANDELKERN in Las Cruces, New Mexico (U.S.A.)') l ) The author is indebted to FRED RICHMAN for several valuable suggestions. 7 Ztschr. f. math. Logik
๐ SIMILAR VOLUMES
SETS by GERD WECHSUNG in Jena (G.D.R.)') 0. Iritroduet,ion and Resnlt,s The consequences of the existence of Theorem 1 ([3]). P = KP o There exists a &-complete sparse set d 7 ~ coNP. Theorem 2 ( [ 7 ] ) . P = N P e There exists a SL-complete sparse set in NP. B precursor of Theorem 2 is contained i
Various types of integrals with respect to signed fuzzy measures on finite sets with cardinality n can be presented as corresponding rules for partitioning the integrand. The partition can be expressed as an n-dimensional vector, whereas the signed fuzzy measure is also an n-dimensional vector. Thus
An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va