Cut rule

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematical logic, the cut rule is an inference rule of sequent calculus. It is a generalisation of the classical modus ponens inference rule. The meaning of the cut rule is that, if a formula A appears as a conclusion in one proof and a hypothesis in another, then another proof in which the formula A does not appear can be deduced. This applies to cases of modus ponens, such as how instances of man are eliminated from Every man is mortal, Socrates is a man to deduce Socrates is mortal. Proofs in systems that include the cut rule often don't have the sub formula property, meaning that there can be formulas in the proof that are not sub formulas of the conclusion. This can cause issues in some proof search methods. Because of this it is often useful to reason about systems without the cut rule. This has led to many cut-elimination theorems for many proof systems in both classical logic and non-classical logic.

In mathematical logic, the cut rule is an inference rule of sequent calculus. It is a generalisation of the classical modus ponens inference rule. The meaning of the cut rule is that, if a formula A appears as a conclusion in one proof and a hypothesis in another, then another proof in which the formula A does not appear can be deduced. This applies to cases of modus ponens, such as how instances of man are eliminated from Every man is mortal, Socrates is a man to deduce Socrates is mortal. Proofs in systems that include the cut rule often don't have the sub formula property, meaning that there can be formulas in the proof that are not sub formulas of the conclusion. This can cause issues in some proof search methods. Because of this it is often useful to reason about systems without the cut rule. This has led to many cut-elimination theorems for many proof systems in both classical logic and non-classical logic.

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1350954366 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.