Computable numberings of families of low sets and Turing jumps in the Ershov hierarchyIf ν and μ are some Δcomputable numberings of families of
sets of the naturals then P(x,y) ⇔ ν
COMBINATORIAL PROBLEMS OF ENUMERATION IN PROGRAMMING CONTESTSThis paper describes a recursive approach to the
enumeration of some classes of combinatorial tasks
Splitting properties of n-C.E. enumeration degreesIt is proved that if 1 < m <
2p ≤ n for some integer p then the elementary theories of posets of m
Universal Generalized Computable Numberings and Hyperimmunity© 2017, Springer Science+Business Media, LLC, part of Springer Nature. Generalized
computable Computable numberings of families of low sets and Turing jumps in the Ershov hierarchyIf ν and μ are some Δcomputable numberings of families of
sets of the naturals then P(x,y) ⇔ ν
Limitwise monotonic reducibility on sets and on pairs of sets© 2016, Allerton Press, Inc.We study limitwise monotonic
sets and pairs of
sets. We investigate
Elementary differences between the (2p)-C. E. and the (2p + 1)-C. E. enumeration degreesIt is proved that the (
2p)-c. e. e-degrees are not elementarily equivalent to the (
2p + 1)-c. e. e
Splitting properties of n-C.E. enumeration degreesIt is proved that if 1 < m <
2p ≤ n for some integer p then the elementary theories of posets of m
Оптимальная нумерация вершин графа электрической сетиThe most optimal
enumeration of electric network graph’s apexes