Elementary Theories for Rogers Semilattices
From MaRDI portal
Publication:3409439
DOI10.1007/s10469-005-0016-xzbMath1106.03041OpenAlexW2008882274MaRDI QIDQ3409439
S. A. Badaev, Andrea Sorbi, Sergei S. Goncharov
Publication date: 17 November 2006
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-005-0016-x
Related Items
Universal computable enumerations of finite classes of families of total functions ⋮ Minimal generalized computable enumerations and high degrees ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ 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 ⋮ Generalized computable universal numberings