Many categorical axioms assert that a particular canonically defined natural transformation between certain functors is invertible. We give two examples of such axioms where the existence of any natural isomorphism between the functors implies the invertibility of the canonical natural transformation. The first example is distributive categories, the second (semi-)additive ones. We show that each follows from a general result about monoidal functors
AbstractMotivated by the semantics of polymorphic programming languages and typed λ-calculi, by form...
We present a class of first-order modal logics, called transformational logics, which are designed f...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
Many categorical axioms assert that a particular canonically defined natural transformation between ...
AbstractMany categorical axioms assert that a particular canonically defined natural transformation ...
A notion of dinatural transformation more restrictive than that in the literature is presented. Cano...
Benabou pointed out in 1963 that a pair f --l u : A -> B of adjoint functors induces a monoidal func...
When are two types the same? In this paper we argue that isomorphism is a more useful notion than eq...
The setting of this work is dependent type theory extended with the univalence axiom. We prove that,...
Many people have studied the problem of describing all isomorphisms between transformation semigroup...
Recently, some of the authors of the present note provided a generalization of Bumby's theorem to th...
When are two types the same? In this paper we argue that isomorphism is a more useful notion than eq...
Using the general notions of finitely presentable and finitely generated object introduced by Gabrie...
In mathematics we enjoy different ways of comparing objects to each other. We usually use isomorphis...
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual s...
AbstractMotivated by the semantics of polymorphic programming languages and typed λ-calculi, by form...
We present a class of first-order modal logics, called transformational logics, which are designed f...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
Many categorical axioms assert that a particular canonically defined natural transformation between ...
AbstractMany categorical axioms assert that a particular canonically defined natural transformation ...
A notion of dinatural transformation more restrictive than that in the literature is presented. Cano...
Benabou pointed out in 1963 that a pair f --l u : A -> B of adjoint functors induces a monoidal func...
When are two types the same? In this paper we argue that isomorphism is a more useful notion than eq...
The setting of this work is dependent type theory extended with the univalence axiom. We prove that,...
Many people have studied the problem of describing all isomorphisms between transformation semigroup...
Recently, some of the authors of the present note provided a generalization of Bumby's theorem to th...
When are two types the same? In this paper we argue that isomorphism is a more useful notion than eq...
Using the general notions of finitely presentable and finitely generated object introduced by Gabrie...
In mathematics we enjoy different ways of comparing objects to each other. We usually use isomorphis...
Traditionally in natural duality theory the algebras carry no topology and the objects on the dual s...
AbstractMotivated by the semantics of polymorphic programming languages and typed λ-calculi, by form...
We present a class of first-order modal logics, called transformational logics, which are designed f...
AbstractWe use relations between Galois algebras and monoidal functors to describe monoidal functors...
DOI
Add to ORKG