AKA 제거

biconditional_elimination
{
P↔Q일 때 P→Q이면 Q→P이다?? chk

Biconditional_elimination = https://en.wikipedia.org/wiki/Biconditional_elimination

쌍조건문_소거 = https://ko.wikipedia.org/wiki/쌍조건문_소거
https://proofwiki.org/wiki/Biconditional_Elimination

"The rule of biconditional elimination
즉 logic에서 다루는 규칙,rule의 일종이며, // 용도가 추론,inference이면 추론규칙,inference_rule? - Positive, 본문에서 'we may infer'
다음 둘:
conditional ⇒
biconditional ⇔
을 다루는 valid_argument { 타당한 논증? curr at 논증,argument }이다.

}

double_negation_elimination DNE ?
{
double_negation {

Double_negation = https://en.wikipedia.org/wiki/Double_negation }

Double_negation_elimination
}

cut-elimination
cut-elimination_theorem
{

MKLINK
시퀀트,sequent
시퀀트 계산 sequent_calculus
cut_rule { 자름? Up: 규칙,rule > 추론규칙,inference_rule }

자름-제거_정리

= https://ko.wikipedia.org/wiki/자름-제거_정리

Cut-elimination_theorem

= https://en.wikipedia.org/wiki/Cut-elimination_theorem

Up: 소거,elimination? 정리,theorem
}

(둘 이상의 수식에서 소거란)
[https]

두산백과: 소거 elimination(https://terms.naver.com/entry.naver?docId=1113593&cid=40942&categoryId=32207) - (easy) 두 개 이상의 식,expression에 공통 문자가 있을 때 그 문자를 포함하지 않는 식을 만드는 과정.
그럼 캔슬레이션,cancellation 이랑 동의어?

컴파일러,compiler에서

common_subexpression_elimination
{

Common_subexpression_elimination = https://en.wikipedia.org/wiki/Common_subexpression_elimination
}

elimination_theory =,elimination_theory .
{
elimination theory
소거론 (wk)

(we)"elimination theory is the classical name for algorithmic approaches to eliminating some variable s

between polynomial s of several variables,
in order to solve (systems of polynomial equations)=>

System_of_polynomial_equations(= polynomial_system = polynomial system)."

MKL
다항식,polynomial
regular_chain =,regular_chain . {

Regular_chain regular+chain }

Grobner_basis or Groebner_basis ?
{
Grobner basis or Groebner basis ? ....