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

It is well known that the problem on A-completeness of finite systems of b.d. functions is algorithmically unsolvable in the general case. Nevertheless, the criterion for A-completeness admits a formulation in terms of A-precomplete classes, and the set of A-precomplete classes is described efficiently. We consider systems of b.d. functions containing all S-b.d. functions depending on one variable and demonstrate that there exists an algorithm to recognise the A-completeness of such systems.

discrete mathematics and applications

On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions