4.3: Propositions, Inferences, and Judgments
- Page ID
- 29603
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)
( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\id}{\mathrm{id}}\)
\( \newcommand{\Span}{\mathrm{span}}\)
\( \newcommand{\kernel}{\mathrm{null}\,}\)
\( \newcommand{\range}{\mathrm{range}\,}\)
\( \newcommand{\RealPart}{\mathrm{Re}}\)
\( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)
\( \newcommand{\Argument}{\mathrm{Arg}}\)
\( \newcommand{\norm}[1]{\| #1 \|}\)
\( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)
\( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)
\( \newcommand{\vectorA}[1]{\vec{#1}} % arrow\)
\( \newcommand{\vectorAt}[1]{\vec{\text{#1}}} % arrow\)
\( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vectorC}[1]{\textbf{#1}} \)
\( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)
\( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)
\( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
\(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)20 Propositions, Inferences, and Judgments35
Consider the following two statements:
- She is annoying, but I love her. - I love her, but she is annoying.
What is being said here? Technically speaking, “but” functions as a conjunction and the two sentences mean logically the exact same thing. They mean, “I love her and she is annoying” and nothing more. It is difficult to capture the subtleties of language in logical systems sometimes, and this is one example. In the first case, the emphasis is on love, and in the second case, it is on annoyance. Today’s Lesson is about some of the subtleties of language and how we understand logic on a day-to-day basis in our ordinary language. While the proposition (a statement that is subject to being True or False) says one thing technically, its regular-language meaning is significantly different. Judgments are when we determine whether the statement is actually True or False. So determining the Truth of the above statement would be one thing in Logic, and another in real-life. Why do we care about the Truth or Falsity of statements? Because knowing whether they are True or False allows us to figure out what else we know. Regardless of their being True or False, there are inferences (statements that necessarily follow from assuming certain statements are True) that we can understand. The process is generally the same: given what we’ve been told, what else can we infer? Logical equivalency means that two statements are Truth-functionally equivalent, which means that they are both True under all the same circumstances. Essentially, this means that whenever one of them is True, the other is True as well. If we can understand which statements are logically equivalent, then we can understand the basic idea of entailments. Single statements can give us some inferences like equivalency, and this is where we will begin before moving to more complex inferences in the forms of proofs and deductions. For now, we’re going to get into some more detail on disjunctions in order to understand what we can infer an understand from basic statements.
Exclusive vs. Nonexclusive Disjunctions36
NOTE: ∙ = & in the text below. There are different notations and in some of them they use ∙ to represent conjunctions.
The connectives “or” and “either … or” are used in two distinct ways in daily discourses. When a host asks you “Coffee or Tea?”, it is implicitly implied that you should choose coffee or tea, but not both. The connective “or” is used in the exclusive sense to mean “one or the other, but not both.” Afterwards, when the host asks you again “Cream or sugar?”, you can respond by saying “Both, please.” Now the connective is used in the nonexclusive sense of “one or the other, or both.”
Here is an example of “either … or …” used in the nonexclusive sense:
Either fire or smoke can damage the paintings.
F ∨ S
F: Fire can damage the paintings.
S: Smoke can damage the paintings.
If either fire or smoke alone can damage the paintings, then the two together can damage the paintings.
In Propositional Logic, the wedge “∨” is used to symbolize nonexclusive disjunctions. So the sentence is symbolized as F ∨ S.
By contrast, in the next sentence “either … or …” is used in the exclusive sense.
The Federal Reserve will either raise interest rates or leave them intact.
∼(R ∙ L)R: The Federal Reserve will raise interest rates.
L: The Federal Reserve will leave interest rates intact.
∼(R ∙ L). The first conjunct R ∨ L means that the Federal Reserve will do one or the other, or both. But the second conjunct ∼(R ∙ L) says that the Federal Reserve will not do both. So together, they capture the meaning of “one or the other, but not both.”How to Symbolize “unless”
A compound sentence formed with the connective “unless” can be symbolized as a conditional or a biconditional, depending on the meaning of the sentence. It can also be symbolized as a disjunction. But in doing so, we need to pay attention to whether it is the exclusive or the nonexclusive disjunction. The sentence
Jeff cannot graduate unless he completes all the GE requirements.
We can also rewrite this as
Either Jeff completes all the GE requirements or he cannot graduate.
∼G ∼G, because it is possible that Jeff completes all the GE requirements but still cannot graduate due to, say, having not yet met the total unit requirement. ∼G is logically equivalent to ∼G ∨ C. As a result, we can symbolize it as ∼G ∨ C.Jeff cannot graduate unless he completes all the GE requirements.
∼G ∨ C
“Not … both …” and “Both … not …”
It is important not to conflate “Not … both …” and “Both … not …”. Compare these two sentences:
Not both Monet and Chopin are painters.
It is not the case that Monet is a painter and Chopin is a painter.
∼(M ∙ C)
M: Monet is a painter.
C: Chopin is a painter.
Both Dvořák and Schubert are not painters.
Dvořák is not a painter and Schubert is not a painter.
∼SD: Dvořák is a painter.
S: Schubert is a painter.
The first sentence denies that both Monet and Chopin are painters. That is, it says that at least one of them is not a painter. It can be rephrased as
Either Monet or Chopin is not a painter.
Either Monet is not a painter or Chopin is not a painter.
∼C ∼C if we expand it fully asEither Monet is not a painter or Chopin is not a painter.
∼C.By contrast, the second sentence is a conjunction.
Both Dvořák and Schubert are not painters.
Dvořák is not a painter and Schubert is not a painter.
∼SD: Dvořák is a painter.
S: Schubert is a painter.
Moreover, this is logically equivalent to both sentences below:
Not either Dvořák or Schubert is a painter.
It is not the case that either Dvořák is a painter or Schubert is a painter.
∼(D ∨ S)
Neither Dvořák nor Schubert is a painter.
It is not the case that either Dvořák is a painter or Schubert is a painter.
∼(D ∨ S)
∼S is logically equivalent to ∼(D ∨ S).The following formulas sum up the differences between “Not … both …” and “Both … not …” and show how to symbolize them:
∼q ∼q = Not either p or q = ∼(p ∨ q) = Neither p nor q = ∼(p ∨ q)