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

We study the validity problem for propositional dependence logic, modaldependence logic and extended modal dependence logic. We show that the validityproblem for propositional dependence logic is NEXPTIME-complete. In addition,we establish that the corresponding problem for modal dependence logic andextended modal dependence logic is NEXPTIME-hard and in NEXPTIME^NP.

Complexity of validity for propositional dependence logics