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 was proved by Sela and by the authors that every formula in the theory ofa free group $F$ is equivalent to a boolean combination of$\exists\forall$-formulas. We also proved that the elementary theory of a freegroup is decidable (there is an algorithm given a sentence to decide whetherthis sentence belongs to $Th(F)$). In this paper we give an algorithm forreduction of a first order formula over a free group to an equivalent booleancombination of $\exists\forall$-formulas.

Quantifier elimination algorithm to boolean combination of $\exists\forall$-formulas in the theory of a free group