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/

Zendy Plus

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

Zendy Tools

Zendy Open

In this paper we present a novel termination order the {\em predicativelexicographic path order} (PLPO for short), a syntactic restriction of thelexicographic path order. As well as lexicographic path orders, severalnon-trivial primitive recursive equations, e.g., primitive recursion withparameter substitution, unnested multiple recursion, or simple nestedrecursion, can be oriented with PLPOs. It can be shown that the PLPO howeveronly induces primitive recursive upper bounds on derivation lengths ofcompatible rewrite systems. This yields an alternative proof of a classicalfact that the class of primitive recursive functions is closed under thosenon-trivial primitive recursive equations.

Predicative Lexicographic Path Orders: An Application of Term Rewriting to the Region of Primitive Recursive Functions