We investigate quantitative properties of BCI and BCK logics. The first part of the paper compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implicationâ€¦ (More)

In the paper [12], E. L. Post described all clones on 2, the two element set {0,1}. In particular, he shown that there are exactly u such clones and each of them is finitely generated. Later, Yu. L.â€¦ (More)

We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is either complete orâ€¦ (More)

22nd Annual IEEE Symposium on Logic in Computerâ€¦

2007

A k-edge operation phi on a finite set A is a k + 1-ary operation that satisfies the identities phi (x,x,y,...,y) ap phi(x,y,x,y,...,y) ap y, phi(y,y,y,x,y,...,y) ap phi(y,y,y,y,x,y,...,y) ap ... apâ€¦ (More)

We analyze the question of existence of asymptotic cumulative probabilities for monadic second order deenable properties of nite algebras. We focus our attention on the directly representableâ€¦ (More)