https://bsccs.stoney-wiki.com/w/index.php?action=history&feed=atom&title=Conjunction 2026-05-04T20:06:56Z Revision history for this page on the wiki MediaWiki 1.39.6 https://bsccs.stoney-wiki.com/w/index.php?title=Conjunction&diff=26&oldid=prev 2025-10-20T13:28:04Z

<p>Created page with &quot;= Conjunction = Conjunction is the logical operation corresponding to &quot;AND&quot;. It returns true only if both propositions are true. == Symbols == * p ∧ q (standard notation) * p &amp; q (common alternative) * p AND q (in programming) == Definition == The conjunction of &#039;&#039;p&#039;&#039; and &#039;&#039;q&#039;&#039; is true if and only if both are true. == Truth Table == {| class=&quot;wikitable&quot; ! p !! q !! p ∧ q |- | T || T || T |- | T || F || F |- | F || T || F |- | F || F || F |} == Examples == * If...&quot;</p> <p><b>New page</b></p><div>= Conjunction =<br /> <br /> Conjunction is the logical operation corresponding to &quot;AND&quot;. <br /> It returns true only if both propositions are true.<br /> <br /> == Symbols ==<br /> * p ∧ q (standard notation)<br /> * p &amp; q (common alternative)<br /> * p AND q (in programming)<br /> <br /> == Definition ==<br /> The conjunction of &#039;&#039;p&#039;&#039; and &#039;&#039;q&#039;&#039; is true if and only if both are true.<br /> <br /> == Truth Table ==<br /> {| class=&quot;wikitable&quot;<br /> ! p !! q !! p ∧ q<br /> |-<br /> | T || T || T<br /> |-<br /> | T || F || F<br /> |-<br /> | F || T || F<br /> |-<br /> | F || F || F<br /> |}<br /> <br /> == Examples ==<br /> * If &#039;&#039;p&#039;&#039; = &quot;I study&quot; and &#039;&#039;q&#039;&#039; = &quot;I pass the exam&quot;, <br /> then &#039;&#039;p ∧ q&#039;&#039; = &quot;I study and I pass the exam&quot;.<br /> * In Python: &lt;code&gt;p and q&lt;/code&gt;<br /> * In Java: &lt;code&gt;p &amp;&amp; q&lt;/code&gt;<br /> <br /> <br /> [[Category:Propositional logic (Aussagenlogik)]]<br /> [[Category: Diskrete Mathematik I (BZG1155pa) 25/26]]</div>

Bfh-sts