Results 271 to 280 of about 3,077,689 (305)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +3 more sources
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
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 +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 +3 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 +3 more sources
Applied Categorical Structures, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francis Borceux, Enrico M. Vitale
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francis Borceux, Enrico M. Vitale
openaire +2 more sources
Applied Categorical Structures, 2007
The usual way to approach topological structures on the objects of a concrete category is via a categorical closure operator [see \textit{D. Dikranjan} and \textit{E. Giuli}, Topology Appl. 27, 129--143 (1987; Zbl 0634.54008)]. This paper puts forward an alternative form of topological structure that is here called a convergence structure.
openaire +2 more sources
The usual way to approach topological structures on the objects of a concrete category is via a categorical closure operator [see \textit{D. Dikranjan} and \textit{E. Giuli}, Topology Appl. 27, 129--143 (1987; Zbl 0634.54008)]. This paper puts forward an alternative form of topological structure that is here called a convergence structure.
openaire +2 more sources
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 +3 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 +3 more sources
Applied Categorical Structures, 2005
The author gives a categorical characterization of pointed subtractive varieties in the sense of \textit{A. Ursini} [Algebra Univers. 31, 204--222 (1994; Zbl 0799.08010)]. Then he shows that the resulting subtractive categories are useful in the theory of Mal'tsev categories.
openaire +1 more source
The author gives a categorical characterization of pointed subtractive varieties in the sense of \textit{A. Ursini} [Algebra Univers. 31, 204--222 (1994; Zbl 0799.08010)]. Then he shows that the resulting subtractive categories are useful in the theory of Mal'tsev categories.
openaire +1 more source