scientific article; zbMATH DE number 1746561
From MaRDI portal
Publication:4530730
zbMath0989.03040MaRDI QIDQ4530730
S. A. Badaev, Sergei S. Goncharov
Publication date: 28 May 2002
Full work available at URL: https://eudml.org/doc/187987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
On \(p \)-universal and \(p \)-minimal numberings ⋮ Minimal generalized computable enumerations and high degrees ⋮ Two theorems on minimal generalized computable numberings ⋮ 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 ⋮ Extremal numberings and fixed point theorems ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets ⋮ 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 ⋮ Ideals without minimal elements in Rogers semilattices ⋮ A family with a single minimal but not least numbering ⋮ Unnamed Item ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ 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 ⋮ On Non-principal Arithmetical Numberings and Families ⋮ Generalized computable universal numberings
This page was built for publication:
