Preferred language:

This is the default search language used by BabelNet
Select the main languages you wish to use in BabelNet:
Selected languages will be available in the dropdown menus and in BabelNet entries

### Z

all preferred languages
•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27     •     Categories: 证明

# 穷举法 · 穷举

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27     •     Categories: Mathematical proofs, Methods of proof, Problem solving methods

# Proof by exhaustion · Separation of Cases · Brute force method · Case splitting · Exhaustive proof

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 where each type of case is checked to see if the proposition in question holds. Wikipedia

## More definitions

Proof by examining all individual cases Wikipedia (disambiguation)

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

IS A
•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# しらみつぶし法 · 場合分けによる証明 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

IS A
•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27

# No term available 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 where each type of case is checked to see if the proposition in question holds. Wikipedia

•     bn:02948928n     •     NOUN     •     Concept    •     Updated on 2019/10/27     •     Categories: Métodos de demostración, Solución de problemas

# Demostración por casos · Prueba por exhaucion · Prueba por exhaución · Prueba por exhaustion · Prueba por exhaustión

La demostración por casos es un método de demostración matemática en el cual la proposición a ser probada se divide en un número finito de casos, y cada caso es demostrado por separado. Wikipedia

## Translations

proof by exhaustion, separation of cases, brute force method, Case splitting, Exhaustive proof, perfect induction, proof-by-exhaustion, proof by cases
しらみつぶし法, 場合分けによる証明
demostración por casos, Prueba por exhaucion, Prueba por exhaución, Prueba por exhaustion, Prueba por exhaustión

## Sources

### Wikidata items

2 sources | 4 senses
3 sources | 11 senses
1 source | 2 senses
3 sources | 10 senses

## Other forms

### BabelNet

almost all but certainly proved