AbstractWe pursue distributive laws between monads, particularly in the context of KZ-doctrines, and show that a very basic distributive law has (constructively) completely distributive lattices for its algebras. Moreover, the resulting monad is shown to be also the double dualization monad (with respect to the subobject classifier) on ordered sets
AbstractWe give a systematic treatment of distributivity for a monad and a comonad as arises in inco...
The familiar adjunction between ordered sets and completely distributive lattices can be extended to...
AbstractIn his paper (1942), Ore found necessary and sufficient conditions under which the modular a...
AbstractWe pursue distributive laws between monads, particularly in the context of KZ-doctrines, and...
htmlabstractDistributive laws of a monad T over a functor F are categorical tools for specifying al...
Abstract. Distributive laws of a monad T over a functor F are categor-ical tools for specifying alge...
Distributive laws between monads (triples) were defined by Jon Beck in the 1960s. They were generali...
Abstract. In this paper we introduce the notion of generalized implication for lattices, as a binary...
Abstract This paper presents a unified account of a number of dual category equiva-lences of relevan...
AbstractRecently, Böhm and Ştefan constructed duplicial (paracyclic) objects from distributive laws ...
This paper presents a unified account of a number of dual category equivalences of relevance to the ...
The main goal of this paper is to explain the link between the algebraic and the Kripke-style models...
An account is given of the categorical duality which exists between bounded distributive lattices an...
To any entailment relation [Sco74] we associate a distributive lattice. We use this to give a constr...
Monads are commonplace in computer science, and can be composed using Beck'sdistributive laws. Unfor...
AbstractWe give a systematic treatment of distributivity for a monad and a comonad as arises in inco...
The familiar adjunction between ordered sets and completely distributive lattices can be extended to...
AbstractIn his paper (1942), Ore found necessary and sufficient conditions under which the modular a...
AbstractWe pursue distributive laws between monads, particularly in the context of KZ-doctrines, and...
htmlabstractDistributive laws of a monad T over a functor F are categorical tools for specifying al...
Abstract. Distributive laws of a monad T over a functor F are categor-ical tools for specifying alge...
Distributive laws between monads (triples) were defined by Jon Beck in the 1960s. They were generali...
Abstract. In this paper we introduce the notion of generalized implication for lattices, as a binary...
Abstract This paper presents a unified account of a number of dual category equiva-lences of relevan...
AbstractRecently, Böhm and Ştefan constructed duplicial (paracyclic) objects from distributive laws ...
This paper presents a unified account of a number of dual category equivalences of relevance to the ...
The main goal of this paper is to explain the link between the algebraic and the Kripke-style models...
An account is given of the categorical duality which exists between bounded distributive lattices an...
To any entailment relation [Sco74] we associate a distributive lattice. We use this to give a constr...
Monads are commonplace in computer science, and can be composed using Beck'sdistributive laws. Unfor...
AbstractWe give a systematic treatment of distributivity for a monad and a comonad as arises in inco...
The familiar adjunction between ordered sets and completely distributive lattices can be extended to...
AbstractIn his paper (1942), Ore found necessary and sufficient conditions under which the modular a...
DOI
Add to ORKG