- Deductive reasoning
- >
- Metalogic
- >
- Proof theory
- >
- Methods of proof

- Fields of mathematics
- >
- Mathematical logic
- >
- Proof theory
- >
- Methods of proof

- Mathematics
- >
- Mathematical proofs
- >
- Proof theory
- >
- Methods of proof

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Proof theory
- >
- Methods of proof

- Theorems
- >
- Mathematical proofs
- >
- Proof theory
- >
- Methods of proof

Method of analytic tableaux

In proof theory, the semantic tableau (/tæˈbloʊ, ˈtæbloʊ/; plural: tableaux, also called truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulae of fi

Analytic proof

In mathematics, an analytic proof is a proof of a theorem in analysis that only makes use of methods from analysis, and which does not predominantly make use of algebraic or geometrical methods. The t

Natural deduction

In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning. This contrasts wi

Proof of impossibility

In mathematics, a proof of impossibility is a proof that demonstrates that a particular problem cannot be solved as described in the claim, or that a particular set of problems cannot be solved in gen

Proof by contrapositive

In logic, the contrapositive of a conditional statement is formed by negating both terms and reversing the direction of inference. More specifically, the contrapositive of the statement "if A, then B"

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

Proof by contradiction

In logic and mathematics, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition, by showing that assuming the proposition to be false leads to a contrad

RecycleUnits

In mathematical logic, proof compression by RecycleUnits is a method for compressing propositional logic resolution proofs.Its main idea is to make use of intermediate (e.g. non input) proof results b

Axiomatic system

In mathematics and logic, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems. A theory is a consistent, relatively-self-cont

Counterexample

A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact

Conditional proof

A conditional proof is a proof that takes the form of asserting a conditional, and proving that the antecedent of the conditional necessarily leads to the consequent.

© 2023 Useful Links.