The familiar adjunction between ordered sets and completely distributive lattices can be extended to generalised metric spaces, that is, categories enriched over a quantale (a lattice of \truth values ), via an appropriate distributive law between the \down-set monad and the \up-set monad on the category of quantale-enriched categories. If the underlying lattice of the quantale is completely distributive, and if powers distribute over non-empty joins in the quantale, then this distributive law can be concretely formulated in terms of operations, equations and choice functions, similar to the familiar distributive law of lattices
A sup-lattice is a complete lattice, a morphism of sup-lattices is a mapping preserving arbitrary su...
This thesis is concerned with two, rather different, areas of analysis. A major part is...
AbstractThere are many situations in logic, theoretical computer science, and category theory where ...
The aim of the thesis is to work towards a many-valued logic over a commutative unital quantale and,...
htmlabstractDistributive laws of a monad T over a functor F are categorical tools for specifying al...
AbstractA Q-distributive lattice is an algebra 〈L, ∧, ∨, ∇, 0, 1〉 of type (2, 2, 1, 0, 0) such that ...
To any entailment relation [Sco74] we associate a distributive lattice. We use this to give a constr...
Abstract. Distributive laws of a monad T over a functor F are categor-ical tools for specifying alge...
Monads are a concept from category theory allowing to model abstractly the notion of computational e...
AbstractWe pursue distributive laws between monads, particularly in the context of KZ-doctrines, and...
Lawvere showed that generalised metric spaces are categories enriched over$[0, \infty]$, the quantal...
Abstract This paper presents a unified account of a number of dual category equiva-lences of relevan...
This paper presents a unified account of a number of dual category equivalences of relevance to the ...
Abstract. In this paper we introduce the notion of generalized implication for lattices, as a binary...
For complete lattices various infinite distributive laws are of interest. Prominent examples are com...
A sup-lattice is a complete lattice, a morphism of sup-lattices is a mapping preserving arbitrary su...
This thesis is concerned with two, rather different, areas of analysis. A major part is...
AbstractThere are many situations in logic, theoretical computer science, and category theory where ...
The aim of the thesis is to work towards a many-valued logic over a commutative unital quantale and,...
htmlabstractDistributive laws of a monad T over a functor F are categorical tools for specifying al...
AbstractA Q-distributive lattice is an algebra 〈L, ∧, ∨, ∇, 0, 1〉 of type (2, 2, 1, 0, 0) such that ...
To any entailment relation [Sco74] we associate a distributive lattice. We use this to give a constr...
Abstract. Distributive laws of a monad T over a functor F are categor-ical tools for specifying alge...
Monads are a concept from category theory allowing to model abstractly the notion of computational e...
AbstractWe pursue distributive laws between monads, particularly in the context of KZ-doctrines, and...
Lawvere showed that generalised metric spaces are categories enriched over$[0, \infty]$, the quantal...
Abstract This paper presents a unified account of a number of dual category equiva-lences of relevan...
This paper presents a unified account of a number of dual category equivalences of relevance to the ...
Abstract. In this paper we introduce the notion of generalized implication for lattices, as a binary...
For complete lattices various infinite distributive laws are of interest. Prominent examples are com...
A sup-lattice is a complete lattice, a morphism of sup-lattices is a mapping preserving arbitrary su...
This thesis is concerned with two, rather different, areas of analysis. A major part is...
AbstractThere are many situations in logic, theoretical computer science, and category theory where ...