Results 281 to 290 of about 2,690,760 (318)
Some of the next articles are maybe not open access.
ABSTRACTIONIST CATEGORIES OF CATEGORIES
The Review of Symbolic Logic, 2015AbstractIf${\cal C}$is a category whose objects are themselves categories, and${\cal C}$has a rich enough structure, it is known that we can recover the internal structure of thecategoriesin${\cal C}$entirely in terms of thearrowsin${\cal C}$. In this sense, the internal structure of the categories in a rich enough category of categories is visible in ...
openaire +1 more source
Axiomatizing a category of categories
Journal of Symbolic Logic, 1991AbstractElementary axioms describe a category of categories. Theorems of category theory follow, including some on adjunctions and triples. A new result is that associativity of composition in categories follows from cartesian closedness of the category of categories. The axioms plus an axiom of infinity are consistent iff the axioms for a well-pointed
openaire +2 more sources
The Kleisli Category is a Category Of Fractions
Quaestiones Mathematicae, 2002Abstract unavailable at this time..> Mathematics Subject Classification (2000): 18C20, 18A99 Quaestiones Mathematicae 25 (2002), 397 ...
Giuli, E, Hardie, KA, Vermeulen, JJC
openaire +2 more sources
The Category of Directed Systems in a Category
Applied Categorical Structures, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Categories of Categories and Categories of Functors
1972The composition of functors in 2.2.6 suggests the study of categories whose objects are categories and whose morphisms are functors. 2.2.7 leads to categories whose objects are functors C→D and whose morphisms are natural transformation. However, familiar antinomies like “the set of all sets.” or “the set of all sets not containing themselves as an ...
openaire +1 more source
Functorial Factorizations in the Category of Model Categories
Applied Categorical Structures, 2021It is familiar that the category of small categories admits a cofibrantly generated model category structure, called the \textit{canonical model category structure}, whose weak equivalences are the equivalences of categories. \textit{M. Hovey} [Model categories. Providence, RI: American Mathematical Society (1999; Zbl 0909.55001), p.
openaire +2 more sources
Mathematical Logic Quarterly, 1988
This paper is related to the work of \textit{F. Tomàs} [e.g. ``Formally recursive analysis'', Publ. Prelim. No.90, Inst. Mat. Univ. Nac. Autòn. México (1985)], who has introduced a strengthened version of recursive analysis. A class R' containing all recursive functions plays a very important role in this construction. One of the purposes of this paper
openaire +2 more sources
This paper is related to the work of \textit{F. Tomàs} [e.g. ``Formally recursive analysis'', Publ. Prelim. No.90, Inst. Mat. Univ. Nac. Autòn. México (1985)], who has introduced a strengthened version of recursive analysis. A class R' containing all recursive functions plays a very important role in this construction. One of the purposes of this paper
openaire +2 more sources
Transparent categories and categories of transition systems
6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), 1965How much information about the internal structure of machines can be derived from the abstract structure of the algebra of the composition of machine homomorphisms? A complete posi, tive answer to this problem is derived by means of categorical algebra methods which are developed in this paper and are applied to transition systems with an arbitrary ...
openaire +1 more source
1986
This paper shows how the constructions involved in category theory may be turned into computer programs. Key issues are the computational representation of categories and of universal properties. The approach is illustrated with a program for computing finite limits of an arbitrary category; this is written in the functional programming language ML. We
Rydeheard, David, Burstall, Rod M
openaire +2 more sources
This paper shows how the constructions involved in category theory may be turned into computer programs. Key issues are the computational representation of categories and of universal properties. The approach is illustrated with a program for computing finite limits of an arbitrary category; this is written in the functional programming language ML. We
Rydeheard, David, Burstall, Rod M
openaire +2 more sources