Results 31 to 40 of about 2,374,826 (325)
CLASSIFICATION THEORY FOR ACCESSIBLE CATEGORIES [PDF]
The Journal of Symbolic Logic, 2016 AbstractWe show that a number of results on abstract elementary classes (AECs) hold in accessible categories with concrete directed colimits. In particular, we prove a generalization of a recent result of Boney on tameness under a large cardinal assumption.
Michael J. Lieberman, Jirí Rosický
openaire +3 more sources
Decomposition theories for abelian categories [PDF]
Transactions of the American Mathematical Society, 1973 Both the classical approach to decomposition theories and Fisher’s technique of constructing decomposition theories from radical functions are extended to and exploited in the context of abelian categories. These two different approaches to decomposition theories for abelian categories intertwine in one theorem from which flows ...
Fisher, Joe W., Wolff, Harvey
openaire +1 more source
Category theory and set theory as theories about complementary types of universals [PDF]
, 2016 Instead of the half-century old foundational feud between set theory and category theory, this paper argues that they are theories about two different complementary types of universals.
Ellerman, David P.
core +3 more sources
Algebraic Presentations of Type Dependency [PDF]
Logical Methods in Computer ScienceC-systems were defined by Cartmell as the algebraic structures that correspond exactly to generalised algebraic theories. B-systems were defined by Voevodsky in his quest to formulate and prove an initiality conjecture for type theories.
Benedikt Ahrens +3 more
doaj +1 more source
On the Axiomatic Systems of Steenrod Homology Theory of Compact Spaces [PDF]
, 2017 On the category of compact metric spaces an exact homology theory was defined and its relation to the Vietoris homology theory was studied by N. Steenrod [S].
Beridze, Anzor, Mdzinarishvili, Leonard
core +3 more sources
String diagrams for Strictification and Coherence [PDF]
Logical Methods in Computer ScienceWhereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied.
Paul Wilson, Dan Ghica, Fabio Zanasi
doaj +1 more source
Journal of Innovation Management, 2020 Competitiveness results from factors beyond the structural conditions and organizational boundaries, such as interorganizational cooperation. Evidence gathered in Brazilian credit unions suggests there is a social process in the firm for generating ...
Bruno da Rocha Braga
doaj +1 more source
The technique of modeling Cyberphysical systems using Coalgebra
Вісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління, 2023 Relevance. Presently, we observe a rapid pace of development in information technologies, the implementation of which results in a broad percentage of automation in manufacturing processes.
Артем Панченко +1 more
doaj +1 more source
Theoretical Computer Science, 1993 The foundations of category theory are considered. Following the example of Tarski's reductionism for first order logic, the authors have built a logical system and a set theory which they call NaDSet (NaD from Natural Deduction). Subtle use of controlled self-reference and other subtle technical means allows them to avoid artificial distinction ...
Paul C. Gilmore, George K. Tsiknis
openaire +1 more source
Experience Implementing a Performant Category-Theory Library in Coq [PDF]
, 2014 We describe our experience implementing a broad category-theory library in Coq. Category theory and computational performance are not usually mentioned in the same breath, but we have needed substantial engineering effort to teach Coq to cope with large ...
A. Miquel +4 more
core +5 more sources