conjunction elimination

Summary

conjunction elimination is a theorem^[1]. It draws 21 Wikipedia views per month (theorem category, ranking #264 of 1,306).^[2]

Key Facts

• conjunction elimination's instance of is recorded as theorem^[3].
• conjunction elimination's instance of is recorded as rule of inference^[4].
• conjunction elimination's subclass of is recorded as change^[5].
• conjunction elimination's subclass of is recorded as simplification^[6].
• conjunction elimination's Freebase ID is recorded as /m/03c9qd^[7].
• conjunction elimination's defining formula is recorded as (P \land Q) \vdash P^[8].
• conjunction elimination's defining formula is recorded as (P \land Q) \vdash Q^[9].
• conjunction elimination's admissible rule in is recorded as intuitionistic logic^[10].
• conjunction elimination's admissible rule in is recorded as propositional calculus^[11].
• conjunction elimination's admissible rule in is recorded as classical logic^[12].
• conjunction elimination's maintained by WikiProject is recorded as WikiProject Mathematics^[13].
• conjunction elimination's Microsoft Academic ID is recorded as 148689803^[14].
• conjunction elimination's Australian Educational Vocabulary ID is recorded as scot/15327^[15].
• conjunction elimination's KBpedia ID is recorded as Simplifying^[16].

Why It Matters

conjunction elimination draws 21 Wikipedia views per month (theorem category, ranking #264 of 1,306).^[2] It has Wikipedia articles in 8 language editions, a strong signal of global cultural recognition.^[17] It is known by 5 alternative names across languages and contexts.^[18]