η-representation of sets and degrees
From MaRDI portal
Publication:5502806
Recommendations
- A characterization of the strongly -representable many-one degrees
- Increasing η -representable degrees
- \(M\)-sets and the representation problem
- Representations of finite sets and correspondences
- The -Enumeration Degrees
- scientific article; zbMATH DE number 18139
- scientific article; zbMATH DE number 427783
- scientific article; zbMATH DE number 1048046
- Representations of Lattices by Sets
- Δ-Sets
Cited in
(17)- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- Computable linear orders and limitwise monotonic functions
- Computable abelian groups
- Limitwise monotonic sequences and degree spectra of structures
- Iterated effective embeddings of abelian p-groups
- Automorphisms of -like computable linear orderings and Kierstead's conjecture
- On limitwise monotonicity and maximal block functions
- A Friedberg enumeration of equivalence structures
- A characterization of the strongly -representable many-one degrees
- On Kierstead’s conjecture
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
- A class of low linear orders having computable presentations
- Effectively infinite classes of numberings and computable families of reals
- Strongly -representable degrees and limitwise monotonic functions
- Generically computable linear orderings
- A theorem on strongly \(\eta \)-representable sets
- A minimal upper bound on a sequence of Turing degrees which represents that sequence
This page was built for publication: η-representation of sets and degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502806)
