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 computable graph $\mathcal{G}$ is computably categorical relative to adegree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies$\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism$f:\mathcal{G}\to\mathcal{B}$. In this paper, we prove that for everycomputable partially ordered set $P$ and computable partition $P=P_0\sqcupP_1$, there exists a computable computably categorical graph $\mathcal{G}$ andan embedding $h$ of $P$ into the c.e. degrees where $\mathcal{G}$ is computablycategorical relative to all degrees in $h(P_0)$ and not computably categoricalrelative to any degree in $h(P_1)$. This is a generalization of a 2021 resultby Downey, Harrison-Trainor, and Melnikov.

Computable categoricity relative to a c.e. degree