|
This article is cited in 6 scientific papers (total in 6 papers)
Ideals without minimal elements in Rogers semilattices
A. A. Issakhov Al-Farabi Kazakh National University, Al-Farabi Ave. 71, Alma-Ata, 050038, Kazakhstan
Abstract:
We prove a criterion for the existence of a minimal numbering, which is reducible to a given numbering of an arbitrary set. The criterion is used to show that, for any infinite $A$-computable family $F$ of total functions, where $\varnothing'\le_TA$, the Rogers semilattice $\mathcal R_A(F)$ of $A$-computable numberings for $F$ contains an ideal without minimal elements.
Keywords:
minimal numbering, $A$-computable numbering, Rogers semilattice, ideal.
Received: 06.11.2014
Citation:
A. A. Issakhov, “Ideals without minimal elements in Rogers semilattices”, Algebra Logika, 54:3 (2015), 305–314; Algebra and Logic, 54:3 (2015), 197–203
Linking options:
https://www.mathnet.ru/eng/al695 https://www.mathnet.ru/eng/al/v54/i3/p305
|
Statistics & downloads: |
Abstract page: | 339 | Full-text PDF : | 80 | References: | 53 | First page: | 9 |
|