Jumps of Hemimaximal Sets
โ Scribed by Rod Downey; Mike Stob
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 457 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An ordered set P is called K-free if it does not contain a four-element subset {a, b, c, d} such that a <b is the only comparability among these elements. In this paper we present a polynomial algorithm to find the jump number of K-free ordered sets. AMS subject classifications (1980). 06Al& &X15.
A JUMP OPERATOR IN SET RECURSION by DAG NORMA" in Oslo (Norway) ## ' ~+ ~# ( e , F ) = k f 3 S is not a normal functional. Recursion in ''+3S does not satisfy stage comparison and that a subset of I is recursive in h+3S if and only if both it and its complement are semirecursive. The reason for t
The maximum size of a jump-critical ordered set with jump-number m is at most (m + l)! AMS (MOS) subject classifications (1980). Primary 06AlO; secondary 68C25.