 Apr 2023

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

 Oct 2021

en.wikipedia.org en.wikipedia.org

Alicia Boole Stott
Alicia was the only Boole sister to inherit the mathematical career of her parents, although her mother Mary Everest Boole had brought up all of her five children from an early age 'to acquaint them with the flow of geometry' by projecting shapes onto paper, hanging pendulums etc. She was first exposed to geometric models by her brotherinlaw Charles Howard Hinton when she was 17, and developed the ability to visualise in a fourth dimension. She found that there were exactly six regular polytopes in four dimensions and that they are bounded by 5, 16 or 600 tetrahedra, 8 cubes, 24 octahedra or 120 dodecahedra.

 Mar 2021

en.wikipedia.org en.wikipedia.org

In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure
a tree (data structure) is the computer science analogue/dual to tree structure in mathematics


en.wikipedia.org en.wikipedia.org

How is it that https://en.wikipedia.org/wiki/Type_theory links to https://en.wikipedia.org/wiki/Type_(model_theory) but the latter does not have any link to or mention of https://en.wikipedia.org/wiki/Type_theory
Neither mentions the relationship between them, but both of them should, since I expect that is a common question.


en.wikipedia.org en.wikipedia.org

Model theory recognizes and is intimately concerned with a duality: it examines semantical elements (meaning and truth) by means of syntactical elements (formulas and proofs) of a corresponding language


 Feb 2021

en.wikipedia.org en.wikipedia.org

In fact, the Product comonad is just the dual of the Writer monad and effectively the same as the Reader monad (both discussed below)

 Jul 2020

en.wikipedia.org en.wikipedia.org

In logic, functions or relations A and B are considered dual if A(Â¬x) = Â¬B(x), where Â¬ is logical negation. The basic duality of this type is the duality of the âˆƒ and âˆ€ quantifiers in classical logic. These are dual because âˆƒx.Â¬P(x) and Â¬âˆ€x.P(x) are equivalent for all predicates P in classical logic

the âˆ§ and âˆ¨ operators are dual in this sense, because (Â¬x âˆ§ Â¬y) and Â¬(x âˆ¨ y) are equivalent. This means that for every theorem of classical logic there is an equivalent dual theorem. De Morgan's laws are examples


en.wikipedia.org en.wikipedia.org

Dual (mathematics), a notion of paired concepts that mirror one another
Tags
Annotators
URL

 May 2020

en.wikipedia.org en.wikipedia.org

Related concepts in other fields are: In natural language, the coordinating conjunction "and". In programming languages, the shortcircuit and control structure. In set theory, intersection. In predicate logic, universal quantification.
Strictly speaking, are these examples of dualities (https://en.wikipedia.org/wiki/Duality_(mathematics))? Or can I only, at strongest, say they are analogous (a looser coonection)?


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


en.wikipedia.org en.wikipedia.org

Mathematically speaking, necessity and sufficiency are dual to one another. For any statements S and N, the assertion that "N is necessary for S" is equivalent to the assertion that "S is sufficient for N".


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


en.wikipedia.org en.wikipedia.org

This is an abstract form of De Morgan's laws, or of duality applied to lattices.


en.wikipedia.org en.wikipedia.org

A plane graph is said to be selfdual if it is isomorphic to its dual graph.



en.wikipedia.org en.wikipedia.org

In mathematical contexts, duality has numerous meanings[1] although it is "a very pervasive and important concept in (modern) mathematics"[2] and "an important general theme that has manifestations in almost every area of mathematics".[3]

 Apr 2020

en.wikipedia.org en.wikipedia.org

the phrase up to is used to convey the idea that some objects in the same class â€” while distinct â€” may be considered to be equivalent under some condition or transformation

"a and b are equivalent up to X" means that a and b are equivalent, if criterion X, such as rotation or permutation, is ignored



en.wikipedia.org en.wikipedia.org

If solutions that differ only by the symmetry operations of rotation and reflection of the board are counted as one, the puzzle has 12 solutions. These are called fundamental solutions; representatives of each are shown below

 Jul 2019

en.wikipedia.org en.wikipedia.org

In Hardy's words, "Exposition, criticism, appreciation, is work for secondrate minds. [...] It is a melancholy experience for a professional mathematician to find himself writing about mathematics. The function of a mathematician is to do something, to prove new theorems, to add to mathematics, and not to talk about what he or other mathematicians have done."
similar to Nassim Taleb's "History is written by losers"
Tags
Annotators
URL

 Jan 2019

en.wikipedia.org en.wikipedia.org

A rooted binary tree is full if every vertex has either two children or no children.
Example of Catalan Numbers use case.
Tags
Annotators
URL


en.wikipedia.org en.wikipedia.org

Catalan numbers notation and short explanation of it.
Use  LookUP: Combinatorics (non crossing combinations) ex: ((())), ()(()), ()()(), (())(), (()())
ref: https://www.geeksforgeeks.org/programnthcatalannumber/

 Sep 2016

en.wikipedia.org en.wikipedia.org

A forest is just a collection of trees. The main difference is that a forest does not necessarily need to be connected.

 Sep 2013

en.wikipedia.org en.wikipedia.org

A computable Dedekind cut is a computable function which when provided with a rational number as input returns or ,
This definition of computable Dedekind cut is wrong. The correct definition is that the lower and the upper cut be computably enumerable.
Tags
Annotators
URL
