hyperarithmetical造句
例句与造句
- The most well known are arithmetical reducibility and hyperarithmetical reducibility.
- The hyperarithmetical hierarchy is defined from these iterated Turing jumps.
- Every arithmetical set is hyperarithmetical, but there are many other hyperarithmetical sets.
- Every arithmetical set is hyperarithmetical, but there are many other hyperarithmetical sets.
- It is closely related to the hyperarithmetical hierarchy.
- It's difficult to find hyperarithmetical in a sentence. 用hyperarithmetical造句挺难的
- It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory.
- The relativized hyperarithmetical hierarchy is used to define "'hyperarithmetical reducibility " '.
- The relativized hyperarithmetical hierarchy is used to define "'hyperarithmetical reducibility " '.
- The equivalence classes of hyperarithmetical equivalence are known as "'hyperdegrees " '.
- An alternate classification of these sets by way of iterated computable functionals is provided by hyperarithmetical theory.
- The definition of hyperarithmetical sets as \ Delta ^ 1 _ 1 does not directly depend on computability results.
- A second, equivalent, definition shows that the hyperarithmetical sets can be defined using infinitely iterated Turing jumps.
- Hyperarithmetical theory is the special case in which & alpha; is \ omega ^ { CK } _ 1.
- It is known that there are non-finitely branching computable subtrees of \ omega ^ { that have no hyperarithmetical path.
- Hyperarithmetical theory is generalized by & alpha;-recursion theory, which is the study of definable subsets of admissible ordinals.
更多例句: 下一页