scientific article; zbMATH DE number 1531919
From MaRDI portal
Publication:4513962
zbMath0961.03038MaRDI QIDQ4513962
S. A. Badaev, Sergei S. Goncharov
Publication date: 28 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
On \(p \)-universal and \(p \)-minimal numberings ⋮ Positive presentations of families relative to \(e\)-oracles ⋮ Embeddability of the semilattice \(L_m^0\) in Rogers semilattices ⋮ Numberings in the analytical hierarchy ⋮ Rogers semilattices of punctual numberings ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ On a Question of Frank Stephan ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ On two types of concept lattices in the theory of numberings ⋮ On the main scientific achievements of Victor Selivanov ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Inductive inference and computable numberings ⋮ A family with a single minimal but not least numbering ⋮ Universal generalized computable numberings and hyperimmunity ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ Positive undecidable numberings in the Ershov hierarchy ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ One-element Rogers semilattices in the Ershov hierarchy ⋮ Families without minimal numberings ⋮ Generalized computable universal numberings
This page was built for publication:
