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/

Zendy Pro

Presents the zaia usage as premium feature

ZAIA

Presents AI Discovery search usage as a premium feature

AI Discovery

Presents AI Discovery explain and summary usage as a premium feature

Content Analysis

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Presents the pdf analysis as premium feature

PDF Analysis

1500 Top-up

3000 Top-up

Zendy Basic

2500 Top-up

Zendy Unlimited

Presents the access of premium content as premium feature

Premium Content

International audienceD. Lau raised the problem of determining the cardinality of the set of all partial clones of Boolean functions whose total part is a given Boolean clone. The key step in the solution of this problem, which was obtained recently by the authors, was to show that the sublattice of strong partial clones on {0, 1} that contain all total functions preserving the relation ρ 0,2 = {(0, 0), (0, 1), (1, 0)} is of continuum cardinality. In this paper we represent relations derived from ρ 0,2 in terms of graphs, and we define a suitable closure operator on graphs such that the lattice of closed sets of graphs is isomorphic to the dual of this uncountable sublattice of strong partial clones. With the help of this duality, we provide a rough description of the structure of this lattice, and we also obtain a new proof for its uncountability

On the interval of strong partial clones of Boolean functions containing Pol({(0, 0), (0, 1), (1, 0)})