Add to ORKGA reducibility on families of subsets of natural numbers is introduced which allows the family per se to be treated without its representation by natural numbers being fixed. This reducibility is used to study a series of problems both in classical computability and on admissible sets: for example, describing index sets of families belonging to sum-3, generalizing Friedberg's completeness theorem for a suitable reducibility on admissible sets, etc. © 2009 Springer Science+Business Media, Inc
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
A set $A\subset \mathbb F_p$ is said to be reducible if it can be represented in the form $A=B+C$ ...
A reducibility on families of subsets of natural numbers is introduced which allows the family per s...
Copy of a paper published 1972 in Russian.N – the set of all natural numbers, F – the set of all tot...
A necessary and sufficient condition is given for a family of sets to be the family of all sets repr...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
© 2020, Springer Science+Business Media, LLC, part of Springer Nature. We point out an existence cri...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω...
The focus of this paper is to find properties inherent to constructible families of subsets. From a ...
A large class of computational problems involve the determination of properties of graphs, digraphs,...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
© 2016, Allerton Press, Inc.We study limitwise monotonic sets and pairs of sets. We investigate the ...
In Part I of this paper we introduced and studied the notion of reducibility and primitivity of subs...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
A set $A\subset \mathbb F_p$ is said to be reducible if it can be represented in the form $A=B+C$ ...
A reducibility on families of subsets of natural numbers is introduced which allows the family per s...
Copy of a paper published 1972 in Russian.N – the set of all natural numbers, F – the set of all tot...
A necessary and sufficient condition is given for a family of sets to be the family of all sets repr...
An almost computably enumerable family that is not Ø′- computably enumerable is constructed. Moreove...
© 2020, Springer Science+Business Media, LLC, part of Springer Nature. We point out an existence cri...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω...
The focus of this paper is to find properties inherent to constructible families of subsets. From a ...
A large class of computational problems involve the determination of properties of graphs, digraphs,...
We study the enumerability of families relative to the enumeration degrees. It is shown that if a fa...
© 2016, Allerton Press, Inc.We study limitwise monotonic sets and pairs of sets. We investigate the ...
In Part I of this paper we introduced and studied the notion of reducibility and primitivity of subs...
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their de...
<正> Let A, B are sets. We can define the reducibility ≤_T~h by A≤_T~hB iff there-exists a poly...
A set $A\subset \mathbb F_p$ is said to be reducible if it can be represented in the form $A=B+C$ ...