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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Rational terms (possibly infinite terms with finitely many subterms) can be represented in a finite way via mu-terms, that is, terms over a signature extended with self-instantiation operators. For example, f(omega) = f(f(f(...))) can be represented as mu(x).f(x) (or also as mu(x).f(f(x)), f(mu x.f(x)),...). Now, if we reduce a mu-term t to s via a rewriting rule using standard notions of the theory of Term Rewriting Systems, how are the rational terms corresponding to t and to s related? We answer to this question in a satisfactory way, resorting to the definition of infinite parallel rewriting proposed by Corradini. We also provide a simple, algebraic description of mu-term rewriting through a variation of Meseguer's Rewriting Logic formalism

Rational term rewriting