scholarly journals Semigroups for flows on limits of graphs

2021 ◽  
Vol 58 ◽  
pp. 7-21
Author(s):  
Christian Budde
Keyword(s):  
Category Theory ◽  
Approximation Theorem ◽  
Strongly Continuous Semigroups ◽  
Growing Networks ◽  
Direct Limits ◽  
Abstract Notion

We use a version of the Trotter-Kato approximation theorem for strongly continuous semigroups in order to study ows on growing networks. For that reason we use the abstract notion of direct limits in the sense of category theory

scholarly journals Reflective subcategories

2000 ◽  
Vol 42 (1) ◽  
pp. 97-113 ◽  
Author(s):  
Juan Rada ◽  
Manuel Saorín ◽  
Alberto del Valle
Keyword(s):  
Category Theory ◽  
Full Subcategory ◽  
Subject Classification ◽  
Adjoint Functor ◽  
Direct Limits ◽  
The Relationship ◽  
Good Behaviour

Given a full subcategory [Fscr ] of a category [Ascr ], the existence of left [Fscr ]-approximations (or [Fscr ]-preenvelopes) completing diagrams in a unique way is equivalent to the fact that [Fscr ] is reflective in [Ascr ], in the classical terminology of category theory.In the first part of the paper we establish, for a rather general [Ascr ], the relationship between reflectivity and covariant finiteness of [Fscr ] in [Ascr ], and generalize Freyd's adjoint functor theorem (for inclusion functors) to not necessarily complete categories. Also, we study the good behaviour of reflections with respect to direct limits. Most results in this part are dualizable, thus providing corresponding versions for coreflective subcategories.In the second half of the paper we give several examples of reflective subcategories of abelian and module categories, mainly of subcategories of the form Copres (M) and Add (M). The second case covers the study of all covariantly finite, generalized Krull-Schmidt subcategories of {\rm Mod}_{R}, and has some connections with the “pure-semisimple conjecture”.1991 Mathematics Subject Classification 18A40, 16D90, 16E70.

Approximation in statistical sense to B -continuous functions by positive linear operators

2010 ◽  
Vol 47 (3) ◽  
pp. 289-298 ◽  
Author(s):  
Fadime Dirik ◽  
Oktay Duman ◽  
Kamil Demirci
Keyword(s):  
Compact Subset ◽  
Real Line ◽  
Statistical Convergence ◽  
Approximation Theorem ◽  
Continuous Functions ◽  
Linear Operators ◽  
Positive Linear Operators ◽  
Statistical Approximation ◽  
Classical Version ◽  
Statistical Sense

In the present work, using the concept of A -statistical convergence for double real sequences, we obtain a statistical approximation theorem for sequences of positive linear operators defined on the space of all real valued B -continuous functions on a compact subset of the real line. Furthermore, we display an application which shows that our new result is stronger than its classical version.

不定自然変換理論に基づく比喩理解モデルの計算論的実装の試み

2020 ◽  
Author(s):  
Shunsuke Ikeda ◽  
Miho Fuyama ◽  
Hayato Saigo ◽  
Tatsuji Takahashi
Keyword(s):  
Category Theory ◽  
Analogical Reasoning ◽  
Machine Learning Techniques ◽  
Huge Amount ◽  
Metaphor Comprehension ◽  
Weighted Directed Graph ◽  
Learning Techniques ◽  
Descriptive Validity ◽  
Association Data ◽  
Human Participants

Machine learning techniques have realized some principal cognitive functionalities such as nonlinear generalization and causal model construction, as far as huge amount of data are available. A next frontier for cognitive modelling would be the ability of humans to transfer past knowledge to novel, ongoing experience, making analogies from the known to the unknown. Novel metaphor comprehension may be considered as an example of such transfer learning and analogical reasoning that can be empirically tested in a relatively straightforward way. Based on some concepts inherent in category theory, we implement a model of metaphor comprehension called the theory of indeterminate natural transformation (TINT), and test its descriptive validity of humans' metaphor comprehension. We simulate metaphor comprehension with two models: one being structure-ignoring, and the other being structure-respecting. The former is a sub-TINT model, while the latter is the minimal-TINT model. As the required input to the TINT models, we gathered the association data from human participants to construct the ``latent category'' for TINT, which is a complete weighted directed graph. To test the validity of metaphor comprehension by the TINT models, we conducted an experiment that examines how humans comprehend a metaphor. While the sub-TINT does not show any significant correlation, the minimal-TINT shows significant correlations with the human data. It suggests that we can capture metaphor comprehension processes in a quite bottom-up manner realized by TINT.

On αβ-statistical convergence for sequences of fuzzy mappings and Korovkin type approximation theorem

Filomat ◽  
2017 ◽  
Vol 31 (12) ◽  
pp. 3749-3760 ◽  
Author(s):  
Ali Karaisa ◽  
Uğur Kadak
Keyword(s):  
Statistical Convergence ◽  
Approximation Theorem ◽  
Linear Operators ◽  
Positive Linear Operators ◽  
Bernstein Operator ◽  
Korovkin Type Approximation Theorem ◽  
Type Approximation ◽  
Inclusion Relations ◽  
Prior Investigation

Upon prior investigation on statistical convergence of fuzzy sequences, we study the notion of pointwise ??-statistical convergence of fuzzy mappings of order ?. Also, we establish the concept of strongly ??-summable sequences of fuzzy mappings and investigate some inclusion relations. Further, we get an analogue of Korovkin-type approximation theorem for fuzzy positive linear operators with respect to ??-statistical convergence. Lastly, we apply fuzzy Bernstein operator to construct an example in support of our result.

Category Theory and Foundations

2018 ◽  
Author(s):  
Michael Ernst
Keyword(s):  
Category Theory ◽  
Mathematical Thinking ◽  
Mathematical Practice ◽  
Foundations Of Mathematics ◽  
Ongoing Debate ◽  
Technical Adequacy ◽  
Theoretical Foundations

In the foundations of mathematics there has been an ongoing debate about whether categorical foundations can replace set-theoretical foundations. The primary goal of this chapter is to provide a condensed summary of that debate. It addresses the two primary points of contention: technical adequacy and autonomy. Finally, it calls attention to a neglected feature of the debate, the claim that categorical foundations are more natural and readily useable, and how deeper investigation of that claim could prove fruitful for our understanding of mathematical thinking and mathematical practice.

Enriched Meanings

2020 ◽  
Author(s):  
Ash Asudeh ◽  
Gianluca Giorgolo
Keyword(s):  
Cognitive Science ◽  
Programming Languages ◽  
Category Theory ◽  
Worst Case ◽  
Disciplinary Boundaries ◽  
Semantics Of Programming Languages ◽  
Basic Meaning ◽  
Language Interpretation ◽  
Major Branch ◽  
Compositional Properties

This book presents a theory of enriched meanings for natural language interpretation. Certain expressions that exhibit complex effects at the semantics/pragmatics boundary live in an enriched meaning space while others live in a more basic meaning space. These basic meanings are mapped to enriched meanings just when required compositionally, which avoids generalizing meanings to the worst case. The theory is captured formally using monads, a concept from category theory. Monads are also prominent in functional programming and have been successfully used in the semantics of programming languages to characterize certain classes of computation. They are used here to model certain challenging linguistic computations at the semantics/pragmatics boundary. Part I presents some background on the semantics/pragmatics boundary, informally presents the theory of enriched meanings, reviews the linguistic phenomena of interest, and provides the necessary background on category theory and monads. Part II provides novel compositional analyses of the following phenomena: conventional implicature, substitution puzzles, and conjunction fallacies. Part III explores the prospects of combining monads, with particular reference to these three cases. The authors show that the compositional properties of monads model linguistic intuitions about these cases particularly well. The book is an interdisciplinary contribution to Cognitive Science: These phenomena cross not just the boundary between semantics and pragmatics, but also disciplinary boundaries between Linguistics, Philosophy and Psychology, three of the major branches of Cognitive Science, and are here analyzed with techniques that are prominent in Computer Science, a fourth major branch. A number of exercises are provided to aid understanding, as well as a set of computational tools (available at the book's website), which also allow readers to develop their own analyses of enriched meanings.

scholarly journals Copula-based software metrics aggregation

2021 ◽  
Author(s):  
Maria Ulan ◽  
Welf Löwe ◽  
Morgan Ericsson ◽  
Anna Wingkvist
Keyword(s):  
Open Source Software ◽  
Software Metrics ◽  
Information Quality ◽  
Empirical Studies ◽  
Probabilistic Approach ◽  
Software Systems ◽  
Quality Model ◽  
Quality Models ◽  
Joint Distributions ◽  
Abstract Notion

AbstractA quality model is a conceptual decomposition of an abstract notion of quality into relevant, possibly conflicting characteristics and further into measurable metrics. For quality assessment and decision making, metrics values are aggregated to characteristics and ultimately to quality scores. Aggregation has often been problematic as quality models do not provide the semantics of aggregation. This makes it hard to formally reason about metrics, characteristics, and quality. We argue that aggregation needs to be interpretable and mathematically well defined in order to assess, to compare, and to improve quality. To address this challenge, we propose a probabilistic approach to aggregation and define quality scores based on joint distributions of absolute metrics values. To evaluate the proposed approach and its implementation under realistic conditions, we conduct empirical studies on bug prediction of ca. 5000 software classes, maintainability of ca. 15000 open-source software systems, and on the information quality of ca. 100000 real-world technical documents. We found that our approach is feasible, accurate, and scalable in performance.

scholarly journals An Essential, Hyperconnected, Local Geometric Morphism that is not Locally Connected

2021 ◽  
Author(s):  
Jens Hemelaer ◽  
Morgan Rogers
Keyword(s):  
Category Theory ◽  
Mailing List ◽  
Geometric Morphism

AbstractThomas Streicher asked on the category theory mailing list whether every essential, hyperconnected, local geometric morphism is automatically locally connected. We show that this is not the case, by providing a counterexample.

Sign in / Sign up

Export Citation Format

Share Document