Rogers semilattices of limitwise monotonic numberings
From MaRDI portal
Publication:6094148
DOI10.1002/MALQ.202100077zbMath1521.03126OpenAlexW4220727858MaRDI QIDQ6094148
Nikolay Bazhenov, Manat Mustafa, Unnamed Author
Publication date: 12 September 2023
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.202100077
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numberings in the analytical hierarchy
- On the cardinality of the upper semilattice of computable enumerations
- The upper semilattice \(L(\gamma)\)
- Two theorems on computable numberings
- On initial segments of computable linear orders
- Classical recursion theory. Vol. II
- Computable models of theories with few models
- Constructive Abelian \(p\)-groups
- Computable linear orders and limitwise monotonic functions
- Computable numberings of families of infinite sets
- Reductions between types of numberings
- Enumeration of families of general recursive functions
- Hyper-hypersimple \(m\)-degrees
- On \(m\)-degrees of recursively enumerable sets
- Limitwise monotonic sequences and degree spectra of structures
- Turing Computability
- Elementary Theories for Rogers Semilattices
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Theorie der Numerierungen I
- Theorie Der Numerierungen III
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- The Family of all Recursively Enumerable Classes of Finite Sets
This page was built for publication: Rogers semilattices of limitwise monotonic numberings