Publication:4513962
From MaRDI portal
zbMath0961.03038MaRDI QIDQ4513962
S. A. Badaev, Sergei S. Goncharov
Publication date: 28 May 2001
03D45: Theory of numerations, effectively presented structures
Related Items
Rogers semilattices of punctual numberings, 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, A family with a single minimal but not least numbering, Positive undecidable numberings in the Ershov hierarchy, Numberings in the analytical hierarchy, Positive presentations of families relative to \(e\)-oracles, Universal generalized computable numberings and hyperimmunity, 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, Theories of Rogers semilattices of analytical numberings, One-element Rogers semilattices in the Ershov hierarchy, On \(p \)-universal and \(p \)-minimal numberings, Weakly precomplete equivalence relations in the Ershov hierarchy, Rogers semilattices for families of equivalence relations in the Ershov hierarchy, Families without minimal numberings, Generalized computable universal numberings, Embeddability of the semilattice \(L_m^0\) in Rogers semilattices, Effective categoricity for distributive lattices and Heyting algebras, Inductive inference and computable numberings, Effectivity questions for Kleene's recursion theorem, Minimal generalized computable numberings and families of positive preorders, Complexity of \(\Sigma^0_n\)-classifications for definable subsets, On a Question of Frank Stephan
