Weak bimonoids in duoidal categories

Weak bimonoids in duoidal categories are introduced. They provide a common generalization of bimonoids in duoidal categories and of weak bimonoids in braided monoidal categories. Under the assumption that idempotent morphisms in the base category split, they are shown to induce weak bimonads (in four symmetric ways). As a consequence, they have four separable Frobenius base (co)monoids, two in each of the underlying monoidal categories. Hopf modules over weak bimonoids are defined by weakly lifting the induced comonad to the Eilenberg–Moore category of the induced monad. Making appropriate assumptions on the duoidal category in question, the fundamental theorem of Hopf modules is proven which says that the category of modules over one of the base monoids is equivalent to the category of Hopf modules if and only if a Galois-type comonad morphism is an isomorphism.     

Structure sheaves of definable additive categories

We prove that the 2-category of small abelian categories with exact functors is anti-equivalent to the 2-category of definable additive categories. We define and compare sheaves of localisations associated to the objects of these categories. We investigate the natural image of the free abelian category over a ring in the module category over that ring and use this to describe a basis for the Ziegler topology on injectives; the last can be viewed model-theoretically as an elimination of imaginaries result.     

The jump operation for structure degrees

One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (in the sense of Soskov) and the jump degrees of a structure (in the sense of Jockusch) and give necessary and sufficient conditions for their existence in the terms of structure degrees. We show some properties, distinguishing the structure degrees from the enumeration degrees.     

An internal language for autonomous categories

We present an internal language for symmetric monoidal closed (autonomous) categories analogous to the typed lambda calculus as an internal language for cartesian closed categories. The language we propose is the term assignment to the multiplicative fragment of Intuitionistic Linear Logic, which possesses exactly the right structure for an autonomous theory. We prove that this language is an internal language and show as an application the coherence theorem of Kelly and Mac Lane, which becomes straightforward to state and prove. Finally, we extend the language with the natural numbers and show that this corresponds to a weak Natural Numbers Object in an autonomous category.     

On the (non)vanishing of some “derived” categories of curved dg algebras

Since curved dg algebras, and modules over them, have differentials whose square is not zero, these objects have no cohomology, and there is no classical derived category. For different purposes, different notions of “derived” categories have been introduced in the literature. In this article, we show that for some concrete curved dg algebras, these derived categories vanish. This happens for example for the initial curved dg algebra whose module category is the category of precomplexes, and for certain deformations of dg algebras.     

Spaces of orders and their Turing degree spectra

We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends Sikora’s (2004) [28] investigation of orders on groups in topology and Solomon’s (2002) [31] investigation of these orders in computable algebra. Furthermore, we establish that a computable free group F_n of rank n>1 has a bi-order in every Turing degree.     

CONCRETE CATEGORIES FOR WHICH FIBRE COMPLETIONS INDUCE TOPOLOGICAL COMPLETIONS

Abstract

Every topological category over an arbitrary base category X may be considered as a category of T-models with respect to some theory (i.e., functor) T from X into a category of complete lattices. Using this model-theoretic correspondence as our basic tool, we study initial and final completions of (co)fibration complete categories. For an arbitrary concrete category (A, U) over X, the process of order-theoretically completing each fibre does not usually yield an initial/final completion of (A, U). It is shown in this paper that for concrete categories which are assumed to be fibration and/or cofibration complete, initial and final completions can be constructed by completing the fibres. These completions are further shown to exhibit some interesting external properties.     

Bernays-Gödel type theory

We study the type-theoretical analogue of Bernays-Gödel set-theory and its models in categories. We introduce the notion of small structure on a category, and if small structure satisfies certain axioms we can think of the underlying category as a category of classes. Our axioms imply the existence of a co-variant powerset monad on the underlying category of classes, which sends a class to the class of its small subclasses. Simple fixed points of this and related monads are shown to be models of intuitionistic Zermelo-Fraenkel set-theory (IZF).     

The homotopy theory of bialgebras over pairs of operads

We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in two steps. In the first step, we equip coalgebras over an operad with a cofibrantly generated model category structure. In the second step we use the adjunction between bialgebras and coalgebras via the free algebra functor. This result allows us to do classical homotopical algebra in various categories such as associative bialgebras, Lie bialgebras or Poisson bialgebras in chain complexes.     

Cartesian Differential Categories as Skew Enriched Categories

We exhibit the cartesian differential categories of Blute, Cockett and Seely as a particular kind of enriched category. The base for the enrichment is the category of commutative monoids—or in a straightforward generalisation, the category of modules over a commutative rig k. However, the tensor product on this category is not the usual one, but rather a warping of it by a certain monoidal comonad Q. Thus the enrichment base is not a monoidal category in the usual sense, but rather a skew monoidal category in the sense of Szlachányi. Our first main result is that cartesian differential categories are the same as categories with finite products enriched over this skew monoidal base. The comonad Q involved is, in fact, an example of a differential modality. Differential modalities are a kind of comonad on a symmetric monoidal k-linear category with the characteristic feature that their co-Kleisli categories are cartesian differential categories. Using our first main result, we are able to prove our second one: that every small cartesian differential category admits a full, structure-preserving embedding into the cartesian differential category induced by a differential modality (in fact, a monoidal differential modality on a monoidal closed category—thus, a model of intuitionistic differential linear logic). This resolves an important open question in this area.

     

Mealy Morphisms of Enriched Categories

We define and study the properties of a notion of morphism of enriched categories, intermediate between strong functor and profunctor. Suggested by bicategorical considerations, it turns out to be a generalization of Mealy machine, well-known since the 1950’s in the theory of computation. When the base category is closed we construct a classifying category for Mealy morphisms, as we call them. This is also seen to give the free tensor completion of an enriched category.     

Effectiveness in RPL, with applications to continuous logic

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of ?ukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to carry out an effective Henkin construction. Therefore, for any effectively given consistent linear theory in continuous logic, we effectively produce its decidable model. This is the best possible, since we show that the computable model theory of continuous logic is an extension of computable model theory of classical logic. We conclude with noting that the unique separable model of a separably categorical and computably axiomatizable theory (such as that of a probability space or an L^p Banach lattice) is decidable.     

Definable categories

We introduce the notion of a definable category–a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are precisely the finite-injectivity classes. We prove a 2-duality between the 2-category of small exact categories and the 2-category of definable categories, and provide a new proof of its additive version. We further introduce a third vertex of the 2-category of regular toposes and show that the diagram of 2-(anti-)equivalences between three 2-categories commutes; the corresponding additive triangle is well-known.     

Computability of finite-dimensional linear subspaces and best approximation

We discuss computability properties of the set P_G(x) of elements of best approximation of some point x∈X by elements of G⊆X in computable Banach spaces X. It turns out that for a general closed set G, given by its distance function, we can only obtain negative information about P_G(x) as a closed set. In the case that G is finite-dimensional, one can compute negative information on P_G(x) as a compact set. This implies that one can compute the point in P_G(x) whenever it is uniquely determined. This is also possible for a wider class of subsets G, given that one imposes additionally convexity properties on the space. If the Banach space X is computably uniformly convex and G is convex, then one can compute the uniquely determined point in P_G(x). We also discuss representations of finite-dimensional subspaces of Banach spaces and we show that a basis representation contains the same information as the representation via distance functions enriched by the dimension. Finally, we study computability properties of the dimension and the codimension map and we show that for finite-dimensional spaces X the dimension is computable, given the distance function of the subspace.     

Universal topological algebra needs closed topological categories

It is shown that a development of universal topological algebra, based in the obvious way on the category of topological spaces, leads in general to a pathological situation. The pathology disappears when the base category is changed to a cartesian closed topological category or to a topological category endowed with a compatible closed symmetric monoidal structure, provided that in the latter case, the algebraic operations are expressed in terms of monoidal powers rather than the usual cartesian powers. With such base categories, universal topological algebra becomes virtually as well-behaved as ordinary (setbased) universal algebra.     

Galois theory in variable categories

The order-reversing bijection between field extensions and subgroups of the Galois group G follows from the equivalence between the opposite of the category of étale algebras and the category of discrete G-spaces [2]. We show that the basic ingredient for this equivalence of categories, and for various known generalizations, is a factorization system for variable categories.     

Turing cones and set theory of the reals

We investigate Turing cones as sets of reals, and look at the relationship between Turing cones, measures, Baire category and special sets of reals, using these methods to show that Martin's proof of Turing Determinacy (every determined Turing closed set contains a Turing cone or is disjoint from one) does not work when you replace “determined” with “Blackwell determined”. This answers a question of Tony Martin. Received: 6 December 1999 / Revised version: 28 June 2000 Published online: 3 October 2001