scientific article; zbMATH DE number 1531919
From MaRDI portal
Publication:4513962
Cited in
(33)- 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
- scientific article; zbMATH DE number 6001222 (Why is no real title available?)
- On a Question of Frank Stephan
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- 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
- Countability constraints in order-theoretic approaches to computability
- On cardinalities of Rogers semilattices for families in the Ershov hierarchy
- Positive undecidable numberings in the Ershov hierarchy
- On arithmetical numberings in reverse mathematics
- On the number of minimal elements of ideals of Rogers semilattices
- Numberings in the analytical hierarchy
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)