If F : Set → Set is a functor which is bounded and preserves weak generalized pullbacks then a class of F-coalgebras is a covariety, i.e., closed under H (homomorphic images), S (sub-coalgebras) and ∑ (sums), if and only if it can be de0ned by a set of “coequations”. Similarly, quasi-covarieties, i.e., classes closed under H and ∑ , can be characterized by implications of coequations. These res...

Matthew Spinks [35] introduces implicative BCSK-algebras, expanding implicative BCK-algebras with an additional binary operation. Subdirectly irreducible implicative BCSK-algebras can be viewed as flat posets with two operations coinciding only in the 1and 2-element cases, each, in the latter case, giving the two-valued implication truth-function. We introduce the resulting logic (for the gener...

It is the basic tenet of the functional approach to typology that at least some linguistic universals may be explained by appealing to features of language use. But the mechanics of the mapping between function and distribution are seldom made explicit. In this paper, a theory of linguistic adaptation is set out in which universals are treated as phenomena of the third kind in Keller’s (1994) t...

Abstract In this paper we extend to various classes of subreducts hoops some results about splitting algebras. particular prove that every finite chain in the purely implicational fragment basic is and $$\{\wedge ,\rightarrow \}$$ { ∧ , → } </...

Some attribute implications in an implicational base of a derived context many-valued can be inferred from some other together with its scales. The scales are interpretation values the therefore they prior or existing knowledge. In knowledge discovery, such redundant and cannot considered as new Therefore should eliminated. This paper shows that redundancy problem exists formalizes model to che...

In this paper, we propose a game semantics for the (associative) Lambek calculus. Compared to the implicational fragment of intuitionistic propositional calculus, the semantics deals with two features of the logic: absence of structural rules, as well as directionality of implication. We investigate the impact of these variations of the logic on

In this paper, we consider two methods for computing lower cover of elements in closure systems for which we know an implicational basis: intersecting meet-irreducible elements or computing minimal transversals of sets of minimal generators. We provide experimental results on the runtimes for single computations of lower covers and depth-first searches.