We've updated our
Privacy Policy effective December 15. Please read our updated Privacy Policy and tap

TEXT
Unlock Solution Steps
Sign in to
Symbolab
Get full access to all Solution Steps for any math problem
By continuing, you agree to our Terms of Use
and have read our Privacy Policy

Study Guides > Mathematics for the Liberal Arts Corequisite

Logic Basics

Introduction

What you’ll learn to do: Create truth tables to interpret statements and conditionals

In the previous section, we discussed fallacies (illogical arguments).  In this section, we focus on constructing logical statements and creating proper arguments. Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meanings of sentences. You use logic informally in everyday life and certainly also in doing mathematics. For example, suppose you are working with a certain circle, call it “Circle X,” and you have available the following two pieces of information.
  1. Circle X has radius equal to 3.
  2. If any circle has radius [latex]r[/latex], then its area is [latex]\pi{r}^{2}[/latex] square units.
You have no trouble putting these two facts together to get:
  1. Circle X has area [latex]9\pi[/latex] square units.
You are using logic to combine existing information to produce new information. Since a major objective in mathematics is to deduce new information, logic must play a fundamental role. This chapter is intended to give you a sufficient mastery of logic.  

Learning Outcomes

  • Determine if a sentence is a statement.
  • Create new statements using connectors and negations.
  • Determine the truth value of a statement using a truth table.
  • Use a truth table to interpret complex statements or conditionals.
  • Write truth tables given a logical implication, and its related statements.
  • Determine whether two statements are logically equivalent.
 

Logical Statements

Statements

A statement (or proposition) is a sentence that makes a claim that is either true or false.
  • We will often use letters to stand for statements.  For example, the letter P could stand for the statement "An apple is a fruit."
 

Example

Decide if each of the following sentences are statements.
  1. Whales are mammals.
  2. The Beatles were the best band of the 20th century.
  3. Millie West was the governor of Colorado in 2015.
  4. Why do you like spaghetti?
  5. Please stop doing that!

Answer:

  1. The truth of this first sentence can easily be decided.  Therefore, it is a statement.
  2. This sentence gives an opinion, therefore its truth cannot be determined.  It is not a statement.  Note that even widely held opinions are not statements.
  3. This sentence is false, but since its truth can be decided (ie: it is not true), it is also a statement.
  4. Questions are not statements because they cannot be labeled as true or false.
  5. Imperatives (commands) are also not statements because they cannot be labeled as true or false.

Try It

[ohm_question]108578[/ohm_question] [ohm_question]108573[/ohm_question]
 

Negation

The logical opposite of a statement is called its negation.  Note that the negation of a statement will have the opposite truth value of the original statement.
  • If a statement is true, its negation will be false.  If a statement is false, its negation will be true.

Example

Give the negation of the statement: Whales are mammals.

Answer: Whales are not mammals.

 

Truth Tables

A truth table is a table showing what the resulting truth value of a complex statement is for all the possible truth values for the simple statements.  We can visualize the relationship between a statement and its negation with a truth table as shown below:
[latex]P[/latex] not [latex]P[/latex]
T F
F T
This first row of this table illustrates that when [latex]P[/latex]  is true,  "not [latex]P[/latex]" is false.  The second row shows that when "not [latex]{P}[/latex]" is true, [latex]P[/latex] is false.   Often, we connect two or more statements together to form a new statement.  For example, when searching the internet, we use terms like “and” and “or” to help us find specific web pages that fit in the categories we are interested in.   When we search for “mystery and comedy” we are looking for a book that satisfies both of these conditions at the same time.  If we were to search for “mystery or comedy” we are looking for a book that is a mystery, a comedy, or both.

Logical Connectors

Let P and Q be statements.
  • The statement P and Q is called their conjunction.  The conjunction is true when both statements P and Q are true.
  • The statement P or Q is called their disjunction.  The disjunction is true when either statement P is true, OR statement Q is true, OR both statement P and statement Q are true
Notice here that or is not exclusive. This is a difference between the logic use of the word and common everyday use. When your significant other asks “do you want to go to the park or the movies?” they are usually proposing an exclusive choice – one option or the other, but not both. In mathematical logic, the or is not exclusive – more like being asked at a restaurant “would you like fries or a drink with that?” Answering “both, please” is an acceptable answer. To make truth tables for the conjunction "P and Q,"  we must analyze all possible combinations of truth values for the individual statements, P and Q.   Since each of these two statements have two possible truth values (i.e.: either True or False), then there are a total of [latex] 2\cdot 2[/latex] cases to consider, namely:
  1. P is true and Q is true.
  2. P is true and Q is false.
  3. P is false and Q is true.
  4. P is false and Q is false.
We analyze each of these four possibilities in the table below.

Truth Table - Conjunction

[latex]P[/latex] [latex]Q[/latex] [latex]P[/latex] and [latex]Q[/latex]
T T T
T F F
F T F
F F F
  Similarly, there are four possible cases to consider for the disjunction "P or Q,"  as shown in the table below.

Truth Tables - Disjunction

[latex]P[/latex] [latex]Q[/latex] [latex]P[/latex] or [latex]Q[/latex]
T T T
T F T
F T T
F F F
 

Example

Suppose you’re picking out a new couch, and your significant other says “get a sectional or something with a chaise.” Construct a truth table that describes the elements of the conditions of this statement and whether the conditions are met.

Answer: This is a complex statement made of two simpler conditions: “is a sectional,” and “has a chaise.” For simplicity, let’s use S to designate “is a sectional,” and C to designate “has a chaise.” The condition S is true if the couch is a sectional. A truth table for this would look like this:

S C S or C
T T T
T F T
F T T
F F F
Notice that in each of the first three rows, the complex statement “S or C” is true. We can get a sectional (row 2); we can get something with a chaise (row 3); we can get a sectional that also has a chaise (row 1).  Each of these three scenarios meet the required conditions.  Remember also that or in logic is not exclusive; if the couch has both features, it does meet the condition.

 

Example

Suppose we are searching a library database for Mexican universities. Express a reasonable search using a logical connector.

Answer: We could start with the search “Mexico and university”, but would be likely to find results for the U.S. state New Mexico. To account for this, we could revise our search to read: Mexico and university not “New Mexico”

  In most internet search engines, it is not necessary to include the word and; the search engine assumes that if you provide two keywords you are looking for both. In Google’s search, the keyword or has to be capitalized as OR, and a negative sign in front of a word is used to indicate not. Quotes around a phrase indicate that the entire phrase should be looked for. The search from the previous example on Google could be written:

Mexico university -“New Mexico”

 

Example

Describe the numbers that meet the condition: even and less than 10 and greater than 0

Answer: The numbers that satisfy all three requirements are {2, 4, 6, 8}

Try It

[ohm_question]25592[/ohm_question]
 

Which Comes First?

Sometimes statements made in English can be ambiguous. For this reason, mathematical logic uses parentheses to show precedent, just like in algebraic order of operations. The English phrase “Go to the store and buy me eggs and bagels or cereal” is ambiguous; it is not clear whether the requestors is asking for eggs always along with either bagels or cereal, or whether they’re asking for either the combination of eggs and bagels, or just cereal. For this reason, using parentheses clarifies the intent:
Eggs and (bagels or cereal) means Option 1: Eggs and bagels, Option 2: Eggs and cereal
(Eggs and bagels) or cereal means  Option 1: Eggs and bagels, Option 2: Cereal
 

Example

Describe the numbers that meet the condition: odd number and less than 20 and greater than 0 and (multiple of 3 or multiple of 5)

Answer: The first three conditions limit us to the numbers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19. The last grouped conditions tell us to include numbers that are also either a multiple of 3 or a multiple of 5. This leaves us with just the numbers: 3, 5, 9, 15 Notice that we would have gotten a very different result if we had written (odd number and less than 20 and greater than 0 and multiple of 3) or multiple of 5 The first grouped set of conditions would give the numbers: 3, 9, 15. When combined with the last condition, though, this set expands without limits to include the numbers:

3, 5, 9, 15, 20, 25, 30, 35, 40, 45, …

Be aware that when a string of conditions is written without grouping symbols, it is often interpreted from the left to right, resulting in the latter interpretation.  

Licenses & Attributions

CC licensed content, Original

CC licensed content, Shared previously

  • Question ID 25462, 25592. Authored by: Lippman, David. License: CC BY: Attribution. License terms: IMathAS Community License CC-BY + GPL.
  • Math in Society. Authored by: Lippman, David. Located at: http://www.opentextbookstore.com/mathinsociety/. License: CC BY: Attribution.
  • Question ID 108578, 108573. Authored by: Hartley,Josiah. License: CC BY: Attribution. License terms: IMathAS Community License CC-BY + GPL.