Turing Degrees in Refinements of the Arithmetical Hierarchy of characterizing proper levels of the fine
hierarchy (up to Turing equivalence). It is known that the fine
Extending Cooper’s theorem to Δ30 Turing degrees of the Ershov
hierarchy is proper. In this paper we investigate proper levels of some extensions of the Ershov
Turing reducibility in the fine hierarchy sets to extend the Ershov
hierarchy beyond Δ20 sets. Similar to the Ershov
hierarchy, Selivanov's fine
Multi-criterial method. Analytic hierarchy processThe analytic
hierarchy process (AHP) is a structured technique for organizing and analyzing complex
Statistical observations on hierarchies of transitivity there is statistical support for a transitivity
hierarchy viewed as an implicational
hierarchy. To that end we
On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy in the difference
hierarchy (degrees of sets from finite levels of the Ershov difference
hierarchy) are studied
Personality Behavior In A Hierarchy Based On Mutual Perceptions behavior in a
hierarchy is given. Decisions on belonging to organizational units (groups) are made
Turing jumps in the Ershov hierarchyWe look at infinite levels of the Ershov
hierarchy in the natural system of notation, which
Relative enumerability in Ershov's hierarchyGeneralizations to various levels of Ershov's
hierarchy of the relationship between n
Turing and enumeration jumps in the Ershov hierarchy hierarchy. © 2010 The Author. Published by Oxford University Press. All rights reserved.