In this paper, we investigate the structural properties of the set of fixpoints for the class of nondeterministic recursive definitions. Our study reveals close resemblance between the structural properties of the set of fixpoints and those of the set of prefixpoints, and it establishes some equalit
On the Existence and Recursion Theoretic Properties of ∑-Generic Sets of Reals
✍ Scribed by Galen Weitkamp
- Publisher
- John Wiley and Sons
- Year
- 1985
- Tongue
- English
- Weight
- 682 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi
## Abstract We present the construction of a probability measure __d__γ with compact support on \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {R}$\end{document} such that adding a discrete pure point results in changes in the recursion coefficients without exp
## Abstract Some classes of graphs are described which are extensions of bipartite multigraphs. Exclusion of some specific partial subgraphs gives some properties of edge colorability. in particular sufficient conditions are developed for the existence of generalized good and equitable colorings.