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

Let $G$ be a countable graph containing a copy of the countable random graph(Erd\H{o}s-R\'enyi graph, Rado graph), $Emb (G)$ the monoid of itsself-embeddings, ${\mathbb P} (G)=\{f[G]: f\in Emb (G)\}$ the set of copies of$G$ contained in $G$, and ${\mathcal I}_G$ the ideal of subsets of $G$ which donot contain a copy of $G$. We show that the poset $< {\mathbb P} (G),\subset>$, the algebra $P (G)/{\mathcal I}_G$, and the inverse of the rightGreen's pre-order $< Emb (G),\preceq ^R >$ have the 2-localization property.The Boolean completions of these pre-orders are isomorphic and satisfy thefollowing law: for each double sequence $[b_{nm}: < n, m > \in \omega \times\omega ]$ of elements of ${\mathbb B}$ $$\textstyle \bigwedge_{n \in \omega}\;\bigvee_{m \in \omega}\; b_{nm} = \bigvee_{{\mathcal T} \,\in \, Bt({}^{<\omega}\omega)}\; \bigwedge_{n \in \omega}\; \bigvee_{\varphi \,\in\,{\mathcal T} \cap {}^{n+1}\omega}\; \bigwedge_{k\leq n}\; b_{k\varphi (k)},$$ where $Bt ({}^{<\omega}\omega)$ denotes the set of all binary subtrees ofthe tree ${}^{<\omega}\omega$.

Copies of the Random Graph: the 2-localization