Weak Distributivity Implying Distributivity

Let $\mathbb{B}$ be a complete Boolean algebra. We show, as an application of a previous result of the author, that if $\lambda$ is an infinite cardinal and $\mathbb{B}$ is weakly $(\lambda^\omega, \omega)$-distributive, then $\mathbb{B}$ is $(\lambda, 2)$-distributive. Using a parallel result, we show that if $\kappa$ is a weakly compact cardinal such that $\mathbb{B}$ is weakly $(2^\kappa, \kappa)$-distributive and $\mathbb{B}$ is $(\alpha, 2)$-distributive for each $\alpha < \kappa$, then $\mathbb{B}$ is $(\kappa, 2)$-distributive.Comment: 12 page

Modern Money Theory and Distributive Justice

Modern money theory is a conjecture concerning fiscal spending and the nature of money. I show that modern money theory provides two interesting insights into distributive justice that have not been addressed in the recent Anglo-American distributive justice literature: (i) that the nature of a sovereign fiat currency allows for some distributive conflicts to be avoided; and (ii) that recent Anglo- American distributive justice theories assume that the economy is at capacity. Based on this, I consider if the policy results of modern money theory can help foster a sense of justice

Distributive laws for Lawvere theories

Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches, involving profunctors, monoidal profunctors, an extension of the free finite-product category 2-monad from Cat to Prof, and factorisation systems respectively. We exhibit comparison functors between CAT and each of these new frameworks to show that the distributive laws between the Lawvere theories correspond in a suitable way to distributive laws between their associated finitary monads. The different but equivalent formulations then provide, between them, a framework conducive to generalisation, but also an explicit description of the composite theories arising from distributive laws.Comment: 30 pages, presented at CT2011, lightly edited 2019 for publication in Compositionalit

Presenting Distributive Laws

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond to simple natural transformations. However, when T is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation from a distributive law for the underlying free monad. We apply this result to show the equivalence between two different representations of context-free languages