On the distributivity equation for uni-nullnorms

summary:A uni-nullnorm is a special case of 2-uninorms obtained by letting a uninorm and a nullnorm share the same underlying t-conorm. This paper is mainly devoted to solving the distributivity equation between uni-nullnorms with continuous Archimedean underlying t-norms and t-conorms and some binary operators, such as, continuous t-norms, continuous t-conorms, uninorms, and nullnorms. The new results differ from the previous ones about the distributivity in the class of 2-uninorms, which have not yet been fully characterized

A discussion on the origin of quantum probabilities

We study the origin of quantum probabilities as arising from non-boolean propositional-operational structures. We apply the method developed by Cox to non distributive lattices and develop an alternative formulation of non-Kolmogorvian probability measures for quantum mechanics. By generalizing the method presented in previous works, we outline a general framework for the deduction of probabilities in general propositional structures represented by lattices (including the non-distributive case).Comment: Improved versio

A class of infinite convex geometries

Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes of examples of such convex geometries are given.Comment: 10 page

Distributivity of ordinal sum implications over overlap and grouping functions

summary:In 2015, a new class of fuzzy implications, called ordinal sum implications, was proposed by Su et al. They then discussed the distributivity of such ordinal sum implications with respect to t-norms and t-conorms. In this paper, we continue the study of distributivity of such ordinal sum implications over two newly-born classes of aggregation operators, namely overlap and grouping functions, respectively. The main results of this paper are characterizations of the overlap and/or grouping function solutions to the four usual distributive equations of ordinal sum fuzzy implications. And then sufficient and necessary conditions for ordinal sum implications distributing over overlap and grouping functions are given

Layer by layer - Combining Monads

We develop a method to incrementally construct programming languages. Our approach is categorical: each layer of the language is described as a monad. Our method either (i) concretely builds a distributive law between two monads, i.e. layers of the language, which then provides a monad structure to the composition of layers, or (ii) identifies precisely the algebraic obstacles to the existence of a distributive law and gives a best approximant language. The running example will involve three layers: a basic imperative language enriched first by adding non-determinism and then probabilistic choice. The first extension works seamlessly, but the second encounters an obstacle, which results in a best approximant language structurally very similar to the probabilistic network specification language ProbNetKAT