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

The unification problem in a propositional logic is to determine, given aformula F, whether there exists a substitution s such that s(F) is in thatlogic. In that case, s is a unifier of F. When a unifiable formula has minimalcomplete sets of unifiers, the formula is either infinitary, finitary, orunitary, depending on the cardinality of its minimal complete sets of unifiers.In this paper, we study the unification types of some modal logics determinedby classes of deterministic frames.

About the unification types of the modal logics determined by classes of deterministic frames