 Apr 2022

hub.jhu.edu hub.jhu.edu

www.sciencedirect.com www.sciencedirect.com

Corner, A., Hahn, U., & Oaksford, M. (2011). The psychological mechanism of the slippery slope argument. Journal of Memory and Language, 64(2), 133–152. https://doi.org/10.1016/j.jml.2010.10.002

 Jan 2022

www.youtube.com www.youtube.com

https://www.youtube.com/watch?v=z3Tvjf0buc8
graph thinking
 intuitive
 speed, agility
 adaptability
; graph thinking : focuses on relationships to turn data into information and uses patterns to find meaning
property graph data model
 relationships (connectors with verbs which can have properties)
 nodes (have names and can have properties)
Examples:
 Purchase recommendations for products in real time
 Fraud detection
Use for dependency analysis

 Sep 2021

www.mdpi.com www.mdpi.com

The CommunitySensor community network ontology can be positioned somewhere in the middle of this spectrum: community network representatives are totally free to come up with their own terms for element and connection types in their own ontologies. However, these terms are organized in a deep structure with communityspecific element and connection types being classified by higherorder element and connection type (sub)categories described in the CommunitySensor community network conceptual model.
Tags
Annotators
URL

 Aug 2021

www.agilemodeling.com www.agilemodeling.com

Figure 1. The relationship between models, documents, source code, and documentation.

 Jul 2021

Tags
Annotators
URL

 Mar 2021

en.wikipedia.org en.wikipedia.org

en.wikipedia.org en.wikipedia.org
Tags
Annotators
URL


en.wikipedia.org en.wikipedia.org

In fact categories can themselves be viewed as type theories of a certain kind

 Feb 2021

en.wikipedia.org en.wikipedia.org

Though rarer in computer science, one can use category theory directly, which defines a monad as a functor with two additional natural transformations. So to begin, a structure requires a higherorder function (or "functional") named map to qualify as a functor:
rare in computer science using category theory directly in computer science What other areas of math can be used / are rare to use directly in computer science?


dryrb.org dryrb.org

It's hard to say why people think so because you certainly don't need to know category theory for using them, just like you don't need it for, say, using functions.

 Oct 2020

www.quantamagazine.org www.quantamagazine.org

In some sense, by studying one model deeply enough, we can study them all.
This may be where math like category theory is particularly powerful as a map between these different areas which are really the same (isomorphic).

 Apr 2020

en.wikipedia.org en.wikipedia.org

In category theory
'
Tags
Annotators
URL

 Jan 2020

en.wikipedia.org en.wikipedia.org

en.wikipedia.org en.wikipedia.org

en.wikipedia.org en.wikipedia.org
 Oct 2019


categorical formalism should provide a much needed high level language for theory of computation, flexible enough to allow abstracting away the low level implementation details when they are irrelevant, or taking them into account when they are genuinely needed. A salient feature of the approach through monoidal categories is the formal graphical language of string diagrams, which supports visual reasoning about programs and computations. In the present paper, we provide a coalgebraic characterization of monoidal computer. It turns out that the availability of interpreters and specializers, that make a monoidal category into a monoidal computer, is equivalent with the existence of a *universal state space*, that carries a weakly final state machine for any pair of input and output types. Being able to program state machines in monoidal computers allows us to represent Turing machines, to capture their execution, count their steps, as well as, e.g., the memory cells that they use. The coalgebraic view of monoidal computer thus provides a convenient diagrammatic language for studying computability and complexity.
monoidal (category > computer)
Tags
Annotators
URL

 Sep 2019


from falsehood you can derive everything ** false \leq truerestrict: don't talk about elements > you have to talk about arrows (relations) .... interview the friends *product types: [pairs, tuples, records,...]

 Aug 2019

bartoszmilewski.com bartoszmilewski.com

But there is an alternative. It’s called denotational semantics and it’s based on math. In denotational semantics every programing construct is given its mathematical interpretation. With that, if you want to prove a property of a program, you just prove a mathematical theorem


www.math3ma.com www.math3ma.com

hierarchy of questions: "What about the relationships between the relationships between the relationships between the...?" This leads to infinity categories. [And a possible brain freeze.] For more, see here.) As pieinthesky as this may sound, these ideascategories, functors, and natural transformationslead to a treasure trove of theory that shows up almost everywhere.
Turtles all the way up

 Jul 2018

arxiv.org arxiv.org

“pulls it back”
minor quibble, maybe this should be surrounded by parantheses
Tags
Annotators
URL

 Jun 2018

arxiv.org arxiv.org

Exercise1.75.Doesbù3chave a right adjointR:N!N? If not, why? If so, does itsright adjoint have a right adjoint?

Remark1.73.IfPandQare total orders andf:P!Qand1:Q!Pare drawn witharrows bending as in Exercise 1.72, we believe thatfis left adjoint to1iff the arrows donot cross. But we have not proved this, mainly because it is difficult to state precisely,and the total order case is not particularly general

The preservation of meets and joins, and hence whether a monotone map sustainsgenerative effects, is tightly related to the concept of a Galois connection, or moregenerally an adjunction.

Galois connections between posets were first considered by Évariste Galois—whodidn’t call them by that name—in the context of a connection he found between “fieldextensions” and “automorphism groups”. We will not discuss this further,

In his work on generative effects, Adam restricts his attention to maps that preservemeets, even while they do not preserve joins. The preservation of meets implies that themapbehaves well when restricting to a subsystem, even if it can throw up surpriseswhen joining systems

n [Ada17], Adam thinks of monotone maps as observations. A monotone map:P!Qis a phenomenon ofPas observed byQ. He defines generative effects of such a mapto be its failure to preserve joins (or more generally, for categories, its failure topreserve colimits)

Example1.61.Consider the twoelement setPfp;q;rgwith the discrete ordering.The setAfp;qgdoes not have a join inPbecause ifxwas a join, we would needpxandqx, and there is no such elementx.Example1.62.In any posetP, we havep_pp^pp.Example1.63.In a power set, the meet of a collection of subsets is their intersection,while the join is their union. This justifies the terminology.Example1.64.In a total order, the meet of a set is its infimum, while the join of a set isits supremum.Exercise1.65.Recall the division ordering onNfrom Example 1.29: we say thatnmifndivides perfectly intom. What is the meet of two numbers in this poset? Whatabout the join?
These are all great examples. I htink 1.65 is gcd and lcm.

These notions will have correlates in category theory, called limits and colimits,which we will discuss in the Chapter 3. For now, we want to make the definition ofgreatest lower bounds and least upper bounds, called meets and joins, precise.

Ifxyandyx, we writexyand sayxandyareequivalent. We call a set with a preorder aposet.

Example1.49.Recall from Example 1.36 that given a setXwe defineEXto be theset of partitions onX, and that a partition may be defined using a surjective functions:XPfor some setP.Any surjective functionf:X!Yinduces a monotone mapf:EY! EX, going“backwards”. It is defined by sending a partitions:YPto the compositef:s:XP

Example1.42 (Opposite poset).Given a posetπP;∫, we may define the opposite posetπP;op∫to have the same set of elements, but withpopqif and only ifqp.

Example1.40 (Product poset).Given posetsπP;∫andπQ;∫, we may define a posetstructure on the product setPQby settingπp;q∫ πp0;q0∫if and only ifpp0andqq0. We call this theproduct poset. This is a basic example of a more generalconstruction known as the product of categories

Contrary to the definition we’ve chosen, the term poset frequently is used to meanpartiallyordered set, rather than preordered set. In category theory terminology, therequirement thatxyimpliesxyis known asskeletality. We thus call partiallyordered setsskeletal posets

 Dec 2015

math.mit.edu math.mit.eduCT4S.pdf16

Lemma 2.5.1.14
Invoke universal property of products

Since ducks can both swim and fly, each duck is found twice inC, once labeled as aflyer and once labeled as a swimmer. The typesAandBare kept disjoint inC, whichjustifies the name “disjoint union.”
The disjoint union reminds me of algebraic datatypes in functional programming languages, whereas a settheoretic union is more like a union in CS: the union has no label associated with it, so additional computation (or errors) may arise due to a lack of ready information about elements in the union.

facts, which are simply “path equivalences” in an olog. It isthe notion of path equivalences that make category theory so powerful.Apathin an olog is a headtotail sequence of arrows

Consider the aspectpan objectqhas››››—pa weightq. At some point in history, thiswould have been considered a valid function. Now we know that the same objectwould have a different weight on the moon than it has on earth. Thus as worldviews change, we often need to add more information to our olog. Even the validityofpan object on earthqhas››››—pa weightqis questionable. However to build a modelwe need to choose a level of granularity and try to stay within it, or the whole modelevaporates into the nothingness of truth!

An aspect of a thingxis a way of viewing it, a particular way in whichxcan be regardedor measured. For example, a woman can be regarded as a person; hence “being a person”is an aspect of a woman. A molecule has a molecular mass (say in daltons), so “havinga molecular mass” is an aspect of a molecule. In other words, byaspectwe simply meana function. The domainAof the functionf:A—Bis the thing we are measuring, andthe codomain is the set of possible “answers” or results of the measurement.
Naïvely (since my understanding of type theory is naïve), this seems to mesh with the concepts of inheritance for the "is" relationships, and also with typetheory more generally for "has" relationships, since I believe we can view any object or "compound type", as defined here, as being a subtype of another type 'o' if one of its elements is of type 'o'. Though we have to be careful for functional mapping when thinking of aspects: we can't just say Int is an aspect of Pair(Int, Int), since this is ambiguous (there are two ints)  we must denote which Int we mean.

We represent eachtype as a box containing asingular indefinite noun phrase.

Data gathering is ubiquitous in science. Giant databases are currently being minedfor unknown patterns, but in fact there are many (many) known patterns that simplyhave not been catalogued. Consider the wellknown case of medical records. A patient’smedical history is often known by various individual doctoroffices but quite inadequatelyshared between them. Sharing medical records often means faxing a handwritten noteor a filledin housecreated form between offices.

As mentioned above category theory has branched out into certain areas of scienceas well. Baez and Dolan have shown its value in making sense of quantum physics, itis well established in computer science, and it has found proponents in several otherfields as well. But to my mind, we are the very beginning of its venture into scientificmethodology. Category theory was invented as a bridge and it will continue to serve inthat role.

All this time, however, category theory was consistently seen by much of the mathematical community as ridiculously abstract. But in the 21st century it has finally cometo find healthy respect within the larger community of pure mathematics. It is the language of choice for graduatelevel algebra and topology courses, and in my opinion willcontinue to establish itself as the basic framework in which mathematics is done

In 1980 Joachim Lambek showed that the types and programs used in computerscience form a specific kind of category. This provided a new semantics for talking aboutprograms, allowing people to investigate how programs combine and compose to createother programs, without caring about the specifics of implementation. Eugenio Moggibrought the category theoretic notion of monads into computer science to encapsulateideas that up to that point were considered outside the realm of such theory.

Bill Lawvere saw category theory as a new foundation for all mathematical thought.Mathematicians had been searching for foundations in the 19th century and were reasonably satisfied with set theory asthe foundation. But Lawvere showed that the categoryof sets is simply a category with certain nice properties, not necessarily the center ofthe mathematical universe. He explained how whole algebraic theories can be viewedas examples of a single system. He and others went on to show that higher order logicwas beautifully captured in the setting of category theory (more specifically toposes).It is here also that Grothendieck and his school worked out major results in algebraicgeometry.
I haven't studied toposes, but I can at least see how introductory algebraic geometry, i.e. the study of Groebner bases, relates to propositional logic.

The paradigm shift brought on by Einstein’s theory of relativity brought on the realization that there is no single perspective from which to view the world. There is nobackground framework that we need to find; there are infinitely many different frameworks and perspectives, and the real power lies in being able to translate between them.It is in this historical context that category theory got its start.

These theorems have not made theirway out into the world of science, but they are directly applicable there. Hierarchies arepartial orders, symmetries are group elements, data models are categories, agent actionsare monoid actions, localtoglobal principles are sheaves, selfsimilarity is modeled byoperads, context can be modeled by monads.

No one would dispute that vector spaces are ubiquitous.But so are hierarchies, symmetries, actions of agents on objects, data models, globalbehavior emerging as the aggregate of local behavior, selfsimilarity, and the effect ofmethodological context.

I will use a mathematical tool calledologs, or ontology logs, to givesome structure to the kinds of ideas that are often communicated in pictures like theone on the cover. Each olog inherently offers a framework in which to record data aboutthe subject. More precisely it encompasses adatabase schema, which means a system ofinterconnected tables that are initially empty but into which data can be entered.

Agreementis the good stuff in science; it’s the high fives.But it is easy to think we’re in agreement, when really we’re not. Modeling ourthoughts on heuristics and pictures may be convenient for quick travel down the road,but we’re liable to miss our turnoff at the first mile. The danger is in mistaking ourconvenient conceptualizations for what’s actually there. It is imperative that we havethe ability at any time to ground out in reality.
