Reducibility on families

DOI10.1007/S10469-009-9037-1zbMath1241.03057OpenAlexW2125598426MaRDI QIDQ431669

V. G. Puzarenko, Iskander Sh. Kalimullin

Publication date: 29 June 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-009-9037-1

zbMATH Keywords

reducibilityadmissible setfamily of subsets of natural numbers

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (11)

Jump inversions of algebraic structures and the \({\Sigma}\)-definability ⋮ Limitwise monotonic reducibility on sets and on pairs of sets ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ Rice sequences of relations ⋮ Jump inversions of algebraic structures and Σ‐definability ⋮ Families of permutations and ideals of Turing degrees ⋮ Unnamed Item ⋮ Fixed points for the jump operator ⋮ Maximality and minimality under limitwise monotonic reducibility ⋮ Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups ⋮ The enumeration spectrum hierarchy ofn-families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerations in computable structure theory
• S-Subsets of Natural Numbers
• On the Degrees of Index Sets. II
• Degrees in Which the Recursive Sets are Uniformly Recursive
• Arithmetical Reducibilities I

This page was built for publication: Reducibility on families