По вашему запросу найдено документов: 44811
Страница 1 из 4482
Computable Linear Orders and the Ershov Hierarchy© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders
Computable linear orders and products with the property that given any countable linear order, is a computable linear order iff is a computable linear
Initial segments of computable linear orders with additional computable predicatesWe study computable linear orders with computable neighborhood and block predicates. In particular
Low linear orderings construct a computable presentation of any low weakly η-like linear ordering with no strongly η
Ranges of η-functions of η-like linear orderingsWe completely describe ranges of η-functions of η-like linear orderings without computable
Computability on linear orderings enriched with predicatesLet L be a quasidiscrete linear ordering. We specify some conditions for the existence of a
Scattered linear orderings with no computable presentationIn this paper we construct a low2 scattered linear orderings with no computable presentation
Initial segments of computable linear orders with additional computable predicatesWe study computable linear orders with computable neighborhood and block predicates. In particular
Presentations of the successor relation of computable linear ordering-like or non-η-like computable linear orderings is closed upwards in the class of all computably enumerable
Linear Orderings of Low DegreeWe consider the class of so-called k-quasidiscrete linear orderings, show that every k
Страница 1 из 4482
Фасеты
Партнеры
Индексация
