scientific article; zbMATH DE number 1531919

Cited in

(30)

Effectively infinite classes of numberings and computable families of reals
On the main scientific achievements of Victor Selivanov
On \(p \)-universal and \(p \)-minimal numberings
Some absolute properties of \(A\)-computable numberings
Elementary theories and hereditary undecidability for semilattices of numberings
Universal generalized computable numberings and hyperimmunity
Embeddability of the semilattice \(L_m^0\) in Rogers semilattices
Numberings in the analytical hierarchy
Inductive inference and computable numberings
A family with a single minimal but not least numbering
Theories of Rogers semilattices of analytical numberings
Computability theory. Abstracts from the workshop held January 7--13, 2018
On a Question of Frank Stephan
Positive presentations of families relative to \(e\)-oracles
scientific article; zbMATH DE number 6001222 (Why is no real title available?)
On two types of concept lattices in the theory of numberings
Generalized computable universal numberings
scientific article; zbMATH DE number 1390024 (Why is no real title available?)
Rogers semilattices of punctual numberings
Effective categoricity for distributive lattices and Heyting algebras
Minimal generalized computable numberings and families of positive preorders
Effectivity questions for Kleene's recursion theorem
Weakly precomplete equivalence relations in the Ershov hierarchy
Positive undecidable numberings 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
Countability constraints in order-theoretic approaches to computability
Complexity of \(\Sigma^0_n\)-classifications for definable subsets
Rogers semilattices of limitwise monotonic numberings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513962)