scientific article
From MaRDI portal
Publication:2709299
zbMath0969.03052MaRDI QIDQ2709299
Andrea Sorbi, Sergei S. Goncharov
Publication date: 24 July 2001
Full work available at URL: https://eudml.org/doc/187832
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On \(p \)-universal and \(p \)-minimal numberings ⋮ Positive presentations of families relative to \(e\)-oracles ⋮ Universal computable enumerations of finite classes of families of total functions ⋮ Embeddability of the semilattice \(L_m^0\) in Rogers semilattices ⋮ Numberings in the analytical hierarchy ⋮ Rogers semilattices of punctual numberings ⋮ Rogers semilattices of families of two embedded sets in the Ershov hierarchy ⋮ Minimal generalized computable enumerations and high degrees ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Two theorems on minimal generalized computable numberings ⋮ Numberings, c.e. oracles, and fixed points ⋮ 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 ⋮ Positive numberings in admissible sets ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Extremal numberings and fixed point theorems ⋮ On two types of concept lattices in the theory of numberings ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ 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 ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Universal generalized computable numberings and hyperimmunity ⋮ Properties of numberings in various levels of the Ershov hierarchy ⋮ Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Unnamed Item ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ On universal pairs in the Ershov hierarchy ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Positive presentations of families in relation to reducibility with respect to enumerability ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Friedberg numberings of families of partial computable functionals ⋮ Positive undecidable numberings in the Ershov hierarchy ⋮ Friedberg numberings in the Ershov hierarchy ⋮ 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 ⋮ Characterizing programming systems allowing program self-reference ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Computable numberings of families of infinite sets ⋮ Khutoretskii's theorem for generalized computable families ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ One-element Rogers semilattices in the Ershov hierarchy ⋮ Reductions between types of numberings ⋮ Families without minimal numberings ⋮ Generalized computable universal numberings ⋮ One note on positive A-computable numberings
