Results 11  20
of
176
Temporal Structures
, 1990
"... We combine the principles of the FloydWarshallKleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertexlabeled spaces. The motivating application is a uniform theory of abstract or parametrized time in which to any given notion of tim ..."
Abstract

Cited by 30 (21 self)
 Add to MetaCart
We combine the principles of the FloydWarshallKleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertexlabeled spaces. The motivating application is a uniform theory of abstract or parametrized time in which to any given notion of time there corresponds an algebra of concurrent behaviors and their operations, always the same operations but interpreted automatically and appropriately for that notion of time. An interesting side application is a language for succinctly naming a wide range of datatypes. 1 Introduction Posets, metric spaces, "closed" automata, and categories have in common the notion of a space of points with distances between points. These distances are respectively truth values, reals, languages, and sets. Distances have two facets, logical and metrical. The logical facet is expressed respectively via implications p ! q between truth values, comparisons x y between reals, inclusions L ` M between langua...
Higher dimensional algebra V: 2groups
 Theory Appl. Categ
"... A 2group is a ‘categorified ’ version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G×G → G has been replaced by a functor. Various versions of this notion have already been explored; our goal here is to provide a detailed introduction to tw ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
A 2group is a ‘categorified ’ version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G×G → G has been replaced by a functor. Various versions of this notion have already been explored; our goal here is to provide a detailed introduction to two, which we call ‘weak ’ and ‘coherent ’ 2groups. A weak 2group is a weak monoidal category in which every morphism has an inverse and every object x has a ‘weak inverse’: an object y such that x ⊗ y ∼ = 1 ∼ = y ⊗ x. A coherent 2group is a weak 2group in which every object x is equipped with a specified weak inverse ¯x and isomorphisms ix: 1 → x ⊗ ¯x, ex: ¯x ⊗ x → 1 forming an adjunction. We describe 2categories of weak and coherent 2groups and an ‘improvement ’ 2functor that turns weak 2groups into coherent ones, and prove that this 2functor is a 2equivalence of 2categories. We internalize the concept of coherent 2group, which gives a quick way to define Lie 2groups. We give a tour of examples, including the ‘fundamental 2group ’ of a space and various Lie 2groups. We also explain how coherent 2groups can be classified in terms of 3rd cohomology classes in group cohomology. Finally, using this classification, we construct for any connected and simplyconnected compact simple Lie group G a family of 2groups G � ( � ∈ Z) having G as its group of objects and U(1) as the group of automorphisms of its identity object. These 2groups are built using Chern–Simons theory, and are closely related to the Lie 2algebras g � ( � ∈ R) described in a companion paper. 1 1
Intuitionistic Necessity Revisited
 PROCEEDINGS OF THE LOGIC AT WORK CONFERENCE
, 1996
"... In this paper we consider an intuitionistic modal logic, which we call IS42 . Our approach is different to others in that we favour the natural deduction and sequent calculus proof systems rather than the axiomatic, or Hilbertstyle, system. Our natural deduction formulation is simpler than other pr ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
In this paper we consider an intuitionistic modal logic, which we call IS42 . Our approach is different to others in that we favour the natural deduction and sequent calculus proof systems rather than the axiomatic, or Hilbertstyle, system. Our natural deduction formulation is simpler than other proposals. The traditional means of devising a modal logic is with reference to a model, and almost always, in terms of a Kripke model. Again our approach is different in that we favour categorical models. This facilitates not only a more abstract definition of a whole class of models but also a means of modelling proofs as well as provability.
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding
, 1996
"... Generalized metric spaces are a common generalization of preorders and ordinary metric spaces (Lawvere 1973). Combining Lawvere's (1973) enrichedcategorical and Smyth' (1988, 1991) topological view on generalized metric spaces, it is shown how to construct 1. completion, 2. topology, and 3. powerdo ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
Generalized metric spaces are a common generalization of preorders and ordinary metric spaces (Lawvere 1973). Combining Lawvere's (1973) enrichedcategorical and Smyth' (1988, 1991) topological view on generalized metric spaces, it is shown how to construct 1. completion, 2. topology, and 3. powerdomains for generalized metric spaces. Restricted to the special cases of preorders and ordinary metric spaces, these constructions yield, respectively: 1. chain completion and Cauchy completion; 2. the Alexandroff and the Scott topology, and the fflball topology; 3. lower, upper, and convex powerdomains, and the hyperspace of compact subsets. All constructions are formulated in terms of (a metric version of) the Yoneda (1954) embedding.
Adjointness in foundations
 Dialectica
, 1969
"... Author’s commentary In this article we see how already in 1967 category theory had made explicit a number of conceptual advances that were entering into the everyday practice of mathematics. For example, local Galois connections (in algebraic geometry, model theory, linear algebra, etc.) are globali ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
Author’s commentary In this article we see how already in 1967 category theory had made explicit a number of conceptual advances that were entering into the everyday practice of mathematics. For example, local Galois connections (in algebraic geometry, model theory, linear algebra, etc.) are globalized into functors, such as Spec, carrying much more information. Also, “theories ” (even when presented symbolically) are viewed explicitly as categories; so are the background universes of sets that serve as the recipients for models. (Models themselves are functors, hence preserve the fundamental operation of substitution/composition in terms of which the other logical operations can be characterized as local adjoints.) My 1963 observation (referred to by Eilenberg and Kelly in La Jolla, 1965), that cartesian closed categories serve as a common abstraction of type theory and propositional logic, permits an invariant algebraic treatment of the essential problem of proof theory, though most of the later work by proof theorists still relies on presentationdependent formulations. This article sums up a stage of the development of the relationship between
Linear lambdaCalculus and Categorical Models Revisited
, 1992
"... this paper we shall consider multiplicative exponential linear logic (MELL), i.e. the fragment which has multiplicative conjunction or tensor,\Omega , linear implication, \Gammaffi, and the logical operator "exponential", !. We recall the rules for MELL in a sequent calculus system in Fig. 1. We us ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
this paper we shall consider multiplicative exponential linear logic (MELL), i.e. the fragment which has multiplicative conjunction or tensor,\Omega , linear implication, \Gammaffi, and the logical operator "exponential", !. We recall the rules for MELL in a sequent calculus system in Fig. 1. We use capital Greek letters \Gamma; \Delta for sequences of formulae and A; B for single formulae. The Exchange rule simply allows the permutation of assumptions. The `! rules' have been given names by other authors. ! L\Gamma1 is called Weakening , ! L\Gamma2 Contraction, ! L\Gamma3 Dereliction and (! R ) Promotion
From proof nets to the free * autonomous category
 Logical Methods in Computer Science, 2(4:3):1–44, 2006. Available from: http://arxiv.org/abs/cs/0605054. [McK05] Richard McKinley. Classical categories and deep inference. In Structures and Deduction 2005 (Satellite Workshop of ICALP’05
, 2005
"... Vol. 2 (4:3) 2006, pp. 1–44 www.lmcsonline.org ..."
An introduction to ncategories
 In 7th Conference on Category Theory and Computer Science
, 1997
"... ..."
Solving Recursive Domain Equations with Enriched Categories
, 1994
"... Both preorders and metric spaces have been used at various times as a foundation for the solution of recursive domain equations in the area of denotational semantics. In both cases the central theorem states that a `converging' sequence of `complete' domains/spaces with `continuous' retraction pair ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Both preorders and metric spaces have been used at various times as a foundation for the solution of recursive domain equations in the area of denotational semantics. In both cases the central theorem states that a `converging' sequence of `complete' domains/spaces with `continuous' retraction pairs between them has a limit in the category of complete domains/spaces with retraction pairs as morphisms. The preorder version was discovered first by Scott in 1969, and is referred to as Scott's inverse limit theorem. The metric version was mainly developed by de Bakker and Zucker and refined and generalized by America and Rutten. The theorem in both its versions provides the main tool for solving recursive domain equations. The proofs of the two versions of the theorem look astonishingly similar, but until now the preconditions for the preorder and the metric versions have seemed to be fundamentally different. In this thesis we establish a more general theory of domains based on the noti...
Categorical structures enriched in a quantaloid: Categories, distributions and functors
 Theory Appl. Categ
"... We study the different guises of the projective objects in Cocont(Q): they are the “completely distributive ” cocomplete Qcategories (the left adjoint to the Yoneda embedding admits a further left adjoint); equivalently, they are the “totally continuous ” cocomplete Qcategories (every object is th ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We study the different guises of the projective objects in Cocont(Q): they are the “completely distributive ” cocomplete Qcategories (the left adjoint to the Yoneda embedding admits a further left adjoint); equivalently, they are the “totally continuous ” cocomplete Qcategories (every object is the supremum of the presheaf of objects “totally below ” it); and also are they the Qcategories of regular presheaves on a regular Qsemicategory. As a particular case, the Qcategories of presheaves on a Qcategory are precisely the “totally algebraic” cocomplete Qcategories (every object is the supremum of the “totally compact” objects below it). We think that these results should be part of a yettobeunderstood “quantaloidenriched domain theory”. 1