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

We consider the two-variable fragment of first-order logic with onedistinguished binary predicate constrained to be interpreted as a transitiverelation. The finite satisfiability problem for this logic is shown to bedecidable, in triply exponential non-deterministic time. The complexity fallsto doubly exponential non-deterministic time if the distinguished binarypredicate is constrained to be interpreted as a partial order.

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable