English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A numbering of a countable family $S$ is a surjective map from the set ofnatural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e.upper semilattices induced by the reducibility between numberings, for families$S\subset P(\omega)$. Working in set theory ZF+DC+PD, we obtain the followingresults on families from various levels of the analytical hierarchy.  For a non-zero number $n$, by $E^1_n$ we denote $\Pi^1_n$ if $n$ is odd, and$\Sigma^1_n$ if $n$ is even. We show that for a finite family $S$ of $E^1_n$sets, its Rogers $E^1_n$-semilattice has the greatest element if and only if$S$ contains the least element under set-theoretic inclusion. Furthermore, if$S$ does not have the $\subseteq$-least element, then the corresponding Rogers$E^1_n$-semilattice is upwards dense.

Rogers semilattices in the analytical hierarchy: The case of finite families