Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

MECE principle

Index MECE principle

The MECE principle, pronounced "meece", is a grouping principle for separating a set of items into subsets that are mutually exclusive (ME) and collectively exhaustive (CE). [1]

7 relations: Aristotle, Business process mapping, Collectively exhaustive events, McKinsey & Company, Mutual exclusivity, Partition of a set, Proof by exhaustion.

Aristotle

Aristotle (Ἀριστοτέλης Aristotélēs,; 384–322 BC) was an ancient Greek philosopher and scientist born in the city of Stagira, Chalkidiki, in the north of Classical Greece.

New!!: MECE principle and Aristotle · See more »

Business process mapping

Business process mapping refers to activities involved in defining what a business entity does, who is responsible, to what standard a business process should be completed, and how the success of a business process can be determined.

New!!: MECE principle and Business process mapping · See more »

Collectively exhaustive events

In probability theory and logic, a set of events is jointly or collectively exhaustive if at least one of the events must occur.

New!!: MECE principle and Collectively exhaustive events · See more »

McKinsey & Company

McKinsey & Company is an American worldwide management consulting firm.

New!!: MECE principle and McKinsey & Company · See more »

Mutual exclusivity

In logic and probability theory, two events (or propositions) are mutually exclusive or disjoint if they cannot both occur (be true).

New!!: MECE principle and Mutual exclusivity · See more »

Partition of a set

In mathematics, a partition of a set is a grouping of the set's elements into non-empty subsets, in such a way that every element is included in one and only one of the subsets.

New!!: MECE principle and Partition of a set · See more »

Proof by exhaustion

Proof by exhaustion, also known as proof by cases, proof by case analysis, complete induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases and each type of case is checked to see if the proposition in question holds.

New!!: MECE principle and Proof by exhaustion · See more »

Redirects here:

MECE, Mece principle.

References

[1] https://en.wikipedia.org/wiki/MECE_principle

OutgoingIncoming
Hey! We are on Facebook now! »