Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy

DOI10.1007/S10469-006-0034-3zbMath1164.03340OpenAlexW2142620687MaRDI QIDQ3546062

S. A. Badaev, Andrea Sorbi, Sergei S. Goncharov

Publication date: 18 December 2008

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

Full work available at URL: https://doi.org/10.1007/s10469-006-0034-3

zbMATH Keywords

computable numberingarithmetical hierarchyRogers semilattice

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (18)

Numberings in the analytical hierarchy ⋮ Rogers semilattices of punctual numberings ⋮ Minimal generalized computable enumerations and high degrees ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ On universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Friedberg numberings of families of partial computable functionals ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Weak reducibility of computable and generalized computable numberings ⋮ Lattice properties of Rogers semilattices of compuatble and generalized computable families ⋮ Reductions between types of numberings ⋮ Generalized computable universal numberings

This page was built for publication: Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy