Type | Rule of inference |
---|---|
Field | Propositional calculus |
Statement | If the proposition [math]\displaystyle{ P }[/math] is true, and the proposition [math]\displaystyle{ Q }[/math] is true, then the logical conjunction of the two propositions [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math] is true. |
Transformation rules |
---|
Propositional calculus |
Rules of inference |
Rules of replacement |
Predicate logic |
Conjunction introduction (often abbreviated simply as conjunction and also called and introduction or adjunction)[1][2][3] is a valid rule of inference of propositional logic. The rule makes it possible to introduce a conjunction into a logical proof. It is the inference that if the proposition [math]\displaystyle{ P }[/math] is true, and the proposition [math]\displaystyle{ Q }[/math] is true, then the logical conjunction of the two propositions [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math] is true. For example, if it is true that "it is raining", and it is true that "the cat is inside", then it is true that "it is raining and the cat is inside". The rule can be stated:
where the rule is that wherever an instance of "[math]\displaystyle{ P }[/math]" and "[math]\displaystyle{ Q }[/math]" appear on lines of a proof, a "[math]\displaystyle{ P \land Q }[/math]" can be placed on a subsequent line.
The conjunction introduction rule may be written in sequent notation:
where [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math] are propositions expressed in some formal system, and [math]\displaystyle{ \vdash }[/math] is a metalogical symbol meaning that [math]\displaystyle{ P \land Q }[/math] is a syntactic consequence if [math]\displaystyle{ P }[/math] and [math]\displaystyle{ Q }[/math] are each on lines of a proof in some logical system;
Original source: https://en.wikipedia.org/wiki/Conjunction introduction.
Read more |