scientific article; zbMATH DE number 1873436
From MaRDI portal
Publication:4795525
zbMath1008.03026MaRDI QIDQ4795525
Publication date: 24 February 2003
Full work available at URL: https://eudml.org/doc/49851
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
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 ⋮ On the embedding of the first nonconstructive ordinal in the Rogers semilattices ⋮ Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets ⋮ Friedberg numberings of families of partial computable functionals ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Khutoretskii's theorem for generalized computable families ⋮ Generalized computable universal numberings
This page was built for publication:
