Увійти

Готові списки джерел за темами / Conceptual morphisms

Зміст

Статті в журналах
Частини книг

Добірка наукової літератури з теми "Conceptual morphisms"

Автор: Grafiati

Опубліковано: 7 червня 2025

Оновлено: 2 серпня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Conceptual morphisms".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Conceptual morphisms"

1

Diego Lanzi. "Morphisms and economic modeling." Journal of Management and Science 12, no. 3 (2022): 144–48. http://dx.doi.org/10.26524/jms.12.77.

Повний текст джерела

Анотація:

Morphisms are widely used in several branches of scienti c inquiry, but not so much in economics. Nevertheless, many conceptual advan- tages in the economic modeling from using a categorical setting exist. In this paper, we discuss why morphisms could be successfully injected into economic modeling and, in particular, that allomorphisms, i.e., structure- altering maps that re-shape economic processes, can be useful for letting economics to be part of relational social science.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Diaconescu, Răzvan. "Representing 3/2-Institutions as Stratified Institutions." Mathematics 10, no. 9 (2022): 1507. http://dx.doi.org/10.3390/math10091507.

Повний текст джерела

Анотація:

On the one hand, the extension of ordinary institution theory, known as the theory of stratified institutions, is a general axiomatic approach to model theories where the satisfaction is parameterized by states of the models. On the other hand, the theory of 3/2-institutions is an extension of ordinary institution theory that accommodates the partiality of the signature morphisms and its syntactic and semantic effects. The latter extension is motivated by applications to conceptual blending and software evolution. In this paper, we develop a general representation theorem of 3/2-institutions a

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Candela, Pablo, and Balázs Szegedy. "Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds." Journal für die reine und angewandte Mathematik (Crelles Journal) 2022, no. 789 (2022): 1–42. http://dx.doi.org/10.1515/crelle-2022-0016.

Повний текст джерела

Анотація:

Abstract We prove a general form of the regularity theorem for uniformity norms, and deduce an inverse theorem for these norms which holds for a class of compact nilspaces including all compact abelian groups, and also nilmanifolds; in particular we thus obtain the first non-abelian versions of such theorems. We derive these results from a general structure theorem for cubic couplings, thereby unifying these results with the Host–Kra Ergodic Structure Theorem. A unification of this kind had been propounded as a conceptual prospect by Host and Kra. Our work also provides new results on nilspace

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Konovalov, V. A. "APPROACH TO THE SYNTHESIS OF AN ALGORITHM PROCESSING ARTIFICIAL INTELLIGENCE DISTRIBUTIONS. Part 2." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 245 (November 2024): 54–63. https://doi.org/10.14489/vkit.2024.11.pp.054-063.

Повний текст джерела

Анотація:

The concept of “mathematical composition” is introduced into scientific circulation and considered as a theoretical-algorithmic abstraction, intended for processing the instructions of the algorithms of Markov networks with abnormal inference and artificial intelligence. In Markov networks with abnormal inference, compositions of сNnet-scheme of the Markov algorithm with indirect that cannot be considered normal are studied. A conceptual model of interaction between objects in the world around us, Markov networks with abnormal inference and artificial intelligence is synthesized. The compositi

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Ellerman, David. "Where Do Adjunctions Come From? Chimera Morphisms and Adjoint Functors in Category Theory." Foundations 5, no. 1 (2025): 10. https://doi.org/10.3390/foundations5010010.

Повний текст джерела

Анотація:

Category theory has foundational importance because it provides conceptual lenses to characterize what is important and universal in mathematics—with adjunction seeming to be the primary lens. Our topic is a theory showing “where adjoints come from”. The theory is based on object-to-object “chimera morphisms”, “heteromorphisms”, or “hets” between the objects of different categories (e.g., the insertion of generators as a set-to-group map). After showing that heteromorphisms can be treated rigorously using the machinery of category theory (bifunctors), we show that all adjunctions between two c

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Konovalov, V. A. "APPROACH TO THE SYNTHESIS OF AN ALGORITHM PROCESSING ARTIFICIAL INTELLIGENCE DISTRIBUTIONS. Part 1." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 244 (October 2024): 50–58. https://doi.org/10.14489/vkit.2024.10.pp.050-058.

Повний текст джерела

Анотація:

An innovative approach to the synthesis of an algorithm that processes artificial intelligence instructions is proposed. This approach hypothesizes that Markov networks with abnormal inference can serve as data sources for artificial intelligence. These networks are considered as a separate type of algorithm specifically for artificial intelligence, because they have a way of transmitting data to it and obtaining knowledge from it. This algorithm specifies a set of instructions that are triggered by the self-cocking mechanism of the Markov network with abnormal inference. These networks themse

Стилі APA, Harvard, Vancouver, ISO та ін.

7

MARTÍ -OLIET, NARCISO, and JOSÉ MESEGUER. "FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY." International Journal of Foundations of Computer Science 02, no. 04 (1991): 297–399. http://dx.doi.org/10.1142/s0129054191000182.

Повний текст джерела

Анотація:

Linear logic has been introduced by Girard as a logic of actions that seems well suited for concurrent computation. This paper surveys recent work on the applications of linear logic to concurrency, with special emphasis on Petri nets and on the use of categorical models. In particular, we present a synthesis of our previous work on the systematic correspondence between Petri nets, linear logic theories, and linear categories, and explain its relationships to work by many other authors. Throughout, we discuss the computational interpretation of the linear logic connectives and illustrate the i

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Черкашин, А. К. "Представительские функции в системах организационного управления: концептуальная метамодель". Информационные и математические технологии в науке и управлении, № 2(38) (21 травня 2025): 140–57. https://doi.org/10.25729/esi.2025.38.2.012.

Повний текст джерела

Анотація:

Проанализированы виды представительских функций управления общественной деятельностью в разных организационных масштабах, выделены их основные характеристики. Особенностью функционирования агентов в каналах взаимодействия автономных систем является относительная независимость их посреднической деятельности, высокая профессиональная подготовка и специализация. Представительские функции выражаются в представлении и защите прав и интересов доверителя преимущественно в форме координации действий, контроля и оперативного информирования. Имеет место заметное отчуждение прав и полномочий в пользу пре

Стилі APA, Harvard, Vancouver, ISO та ін.

9

ESCARDÓ, MARTÍN, and PAULO OLIVA. "Selection functions, bar recursion and backward induction." Mathematical Structures in Computer Science 20, no. 2 (2010): 127–68. http://dx.doi.org/10.1017/s0960129509990351.

Повний текст джерела

Анотація:

Bar recursion arises in constructive mathematics, logic, proof theory and higher-type computability theory. We explain bar recursion in terms of sequential games, and show how it can be naturally understood as a generalisation of the principle of backward induction that arises in game theory. In summary, bar recursion calculates optimal plays and optimal strategies, which, for particular games of interest, amount to equilibria. We consider finite games and continuous countably infinite games, and relate the two. The above development is followed by a conceptual explanation of how the finite ve

Стилі APA, Harvard, Vancouver, ISO та ін.

10

NICOLAIDIS, A. "CATEGORICAL FOUNDATION OF QUANTUM MECHANICS AND STRING THEORY." International Journal of Modern Physics A 24, no. 06 (2009): 1175–83. http://dx.doi.org/10.1142/s0217751x09043079.

Повний текст джерела

Анотація:

The unification of quantum mechanics and general relativity remains the primary goal of theoretical physics, with string theory appearing as the only plausible unifying scheme. In the present work, in a search of the conceptual foundations of string theory, we analyze the relational logic developed by C. S. Peirce in the late 19th century. The Peircean logic has the mathematical structure of a category with the relation Rij among two individual terms Si and Sj, serving as an arrow (or morphism). We introduce a realization of the corresponding categorical algebra of compositions, which naturall

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Conceptual morphisms"

1

Krötzsch, Markus, Pascal Hitzler, and Guo-Qiang Zhang. "Morphisms in Context." In Conceptual Structures: Common Semantics for Sharing Knowledge. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11524564_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Mikolajczak, Boleslaw, and Zuyan Wang. "Conceptual Modeling of Concurrent Systems through Stepwise Abstraction and Refinement Using Petri Net Morphisms." In Conceptual Modeling - ER 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39648-2_34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Mikolajczak, Boleslaw, and Zuyan Wang. "Conceptual Modeling of Concurrent Information Systems with General Morphisms of Petri Nets." In Intelligent Information Processing and Web Mining. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-36562-4_57.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

"On Dimensionality, Orthogonal Morphisms and the Naughty Turd." In Conceptual Mathematics and Literature. BRILL, 2020. http://dx.doi.org/10.1163/9789004442375_009.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!