Lattice properties of Rogers semilattices of compuatble and generalized computable families
From MaRDI portal
Publication:2285202
Recommendations
- The Rogers semilattices of generalized computable enumerations
- scientific article; zbMATH DE number 1746561
- Some properties of the upper semilattice of computable families of computably enumerable sets
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- scientific article; zbMATH DE number 24993
Cites work
- scientific article; zbMATH DE number 5224002 (Why is no real title available?)
- Enumeration of families of general recursive functions
- Generalized computable numerations and nontrivial Rogers semilattices
- Generalized computable universal numberings
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- Local structure of Rogers semilattices of Σn 0-computable numberings
- Relationships Between Reducibilities
- Some absolute properties of \(A\)-computable numberings
- The Rogers semilattices of generalized computable enumerations
- Two theorems on computable numberings
- Universal generalized computable numberings and hyperimmunity
Cited in
(7)- Rogers Semilattices of Finite Partially Ordered Sets
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- The Rogers semilattices of generalized computable enumerations
- Some properties of the upper semilattice of computable families of computably enumerable sets
- scientific article; zbMATH DE number 1746561 (Why is no real title available?)
- Computability of distributive lattices
- On computable presentations of some functional lattices
This page was built for publication: Lattice properties of Rogers semilattices of compuatble and generalized computable families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285202)