<?xml version="1.0" encoding="UTF-8"?>

<record version="9" id="536">
 <title>disjunction</title>
 <name>Disjunction</name>
 <created>2001-10-26 07:05:03</created>
 <modified>2005-02-28 09:42:09</modified>
 <type>Definition</type>
 <creator id="2" name="akrowne"/>
 <author id="2" name="akrowne"/>
 <classification>
	<category scheme="msc" code="03B05"/>
 </classification>
 <synonyms>
	<synonym concept="disjunction" alias="logical or"/>
	<synonym concept="disjunction" alias="disjunctive truth function"/>
 </synonyms>
 <related>
	<object name="Conjunction"/>
	<object name="PropositionalLogic"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>A disjunction is true if either of its parameters (called disjuncts) are true.  Disjunction does \emph{not} correspond to ``or'' in English (see exclusive or.)  Disjunction uses the symbol $\lor$ or sometimes $+$ when taken in algebraic context.  Hence, disjunction of $a$ and $b$ would be written $$ a \lor b $$ or $$ a + b $$  The truth table for  disjunction is 

\begin{center}
\begin{tabular}{ccc}
$a$ &amp; $b$ &amp; $a \lor b$ \\
\hline
F &amp; F &amp; F \\
F &amp; T &amp; T \\
T &amp; F &amp; T \\
T &amp; T &amp; T
\end{tabular}
\end{center}</content>
</record>
