Ideals without minimal elements in Rogers semilattices

DOI10.1007/s10469-015-9340-yzbMath1393.03024OpenAlexW2189859762MaRDI QIDQ903180

A. A. Issakhov

Publication date: 5 January 2016

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-015-9340-y

zbMATH Keywords

ideal\(A\)-computable numberingminimal numberingRogers semilattice

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Positive presentations of families relative to \(e\)-oracles ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Some absolute properties of \(A\)-computable numberings ⋮ The Rogers semilattices of generalized computable enumerations

Cites Work

• Unnamed Item
• Unnamed Item
• Two existence theorems for computable numerations
• On some examples of upper semilattices of computable enumerations
• The computable enumerations of families of general recursive functions
• Generalized computable universal numberings
• Enumeration of families of general recursive functions

This page was built for publication: Ideals without minimal elements in Rogers semilattices