The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies the previous results. This opens the way to several new examples; in particular we demonstrate an application to Petri nets. 1

Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a category-theoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed category. We show how several familiar examples of categories of partial equivalence relations fit into the general framework. 1 Introduction Partial equivalence relations (and categories of these) are a standard tool in semantics of programming languages, see e.g. [2, 5, 7, 9, 15, 17, 20, 22, 35] and [6, 29] for extensive surveys. They are usefully applied to give proofs of correctness and adequacy since they often provide a cartesian closed category with additional properties. Take for instance a partial equivalence relation on the set of natural numbers: a binary relation R ` N\ThetaN on th...

We consider processes consisting of a category of states varying over a control category as prescribed by a unique factorisation lifting functor. After a brief analysis of the structure of general processes in this setting, we restrict attention to linearly-controlled ones. To this end, we introduce and study a notion of path-linearisable category in which any two paths of morphisms with equal composites can be linearised (or interleaved) in a canonical fashion. Our main result is that categories of linearly-controlled processes (viz., processes controlled by path-linearisable categories) are sheaf models. Introduction This work is an investigation into the mathematical structure of processes. The processes to be considered embody a notion of state space varying according to a control. This we formalise as a category of states (and their inter-relations) Xequipped with a control functor X C f . There are different ways in which the control category C may be required to control t...

It is shown that many weak factorization systems appearing in functorial Quillen model categories, including all those that are cofibrantly generated, come with a rich computational structure, defined by a certain lax algebra with respect to the "squaring monad" on CAT. This structure largely facilitates natural choices for left or right liftings once certain basic natural choices have been made. The use of homomorphisms of such lax algebras is also discussed, with focus on "lax freeness". Mathematics Subject Classification: 18A32, 18C20, 18D05, 55P05. Key words: weak factorization system, cofibrantly generated system, (symmetric) lax factorization algebra, lax homomorphism. Supported by the Ministry of Education of the Czech Republic under project MSM 143100009. y Partial financial assistance by NSERC is acknowledged. 1 1. Introduction Weak factorization systems appear prominently in the definition of Quillen model category: for C, W, F the classes of cofibrations, weak equiva...

The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that

We present a complete elementary axiomatization of local maps of toposes. 1

This paper was inspired by the hard-to-beleive fact that Jiˇrí Rosick´y is getting sixty. We are happy to dedicate our paper to his birthday. Abstract. A logic of orthogonality characterizes all “orthogonality consequences” of a given class Σ of morphisms, i.e. those morphisms s such that every object orthogonal to Σ is also orthogonal to s. A simple four-rule deduction system is formulated which is sound in every cocomplete category. In locally presentable categories we prove that the deduction system is also complete (a) for all classes Σ of morphisms such that all members except a set are regular epimorphisms and (b) for all classes Σ, without restriction, under the set-theoretical assumption that Vopěnka’s Principle holds. For finitary morphisms, i.e. morphisms with finitely presentable domains and codomains, an appropriate finitary logic is presented, and proved to be sound and complete; here the proof follows immediately from previous joint results of Jiˇrí Rosick´y and the first two authors. 1.

Abstract. We show, for an arbitrary adjunction F ⊣ U: B→Awith B Cauchy complete, that the functor F is comonadic if and only if the monad T on A induced by the adjunction is of effective descent type, meaning that the free T-algebra functor F T: A→A T is comonadic. This result is applied to several situations: In Section 4 to give a sufficient condition for an exponential functor on a cartesian closed category to be monadic, in Sections 5 and 6 to settle the question of the comonadicity of those functors whose domain is Set, orSet⋆, or the category of modules over a semisimple ring, in Section 7 to study the effectiveness of (co)monads on module categories. Our final application is a descent theorem for noncommutative rings from which we deduce an important result of A. Joyal and M. Tierney and of J.-P. Olivier, asserting that the effective descent morphisms in the opposite of the category of commutative unital rings are precisely the pure monomorphisms. 1.

. A new description of the exact completion C ex/reg of a regular category C is given, using a certain topos Shv(C) of sheaves on C; the exact completion is then constructed as the closure of C in Shv(C) under finite limits and coequalizers of equivalence relations. An infinitary generalization is proved, and the classical description of the exact completion is derived. 1. Introduction A category C with finite limits is said to be regular if every morphism factorizes as a strong epimorphism followed by a monomorphism, and moreover the strong epimorphisms are stable under pullback; it follows that the strong epimorphisms are precisely the regular epimorphisms, namely those arrows which are the coequalizer of their kernel pair. Every kernel pair is an equivalence relation; a regular category is said to be exact if every equivalence relation is a kernel pair. Thus a regular category is a category with finite limits and coequalizers of kernel pairs, satisfying certain exactness condition...

Introduction In (Plotkin 1985) a revitalised approach to domain theory was initiated. Roughly, the idea was to eliminate the bottom from the domains and to keep the functions partially defined. Thus replacing Cppo (the category of small cppos ---posets with a least element and closed under lubs of !-chains--- and continuous functions) with pCpo (the category of small cpos ---posets closed under lubs of !-chains--- and partial continuous functions --- see Subsection 3.1). One important point in the reformulation is the recognition of pCpo Research partially supported by Fundaci'on Antorchas and The British Council grant ARG 2281/14/6, and SERC grant RR30735. as a category of partial maps as, for example, such presentation fits better with standard formulations of recursion theory and it allows a categorical description of data types (via partial cartesian closed categories (Longo and Moggi 1984) with finite coproducts) in the presence of fixed-point operators. Following the main moti