# Compound propositions constructed from logical

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: x + 1 = 2 d)  x + y = z Proposi\$onal Logic ༉  Constructing Propositions ༉  Propositional Variables: p, q, r, s, … ༉  The proposition that is always true is denoted by T and the proposition that is always false is denoted by F. ༉  Compound Propositions; constructed from logical connectives and other propositions ༉  ༉  ༉  ༉  ༉  Negation ¬ Conjunction ∧ Disjunction ∨ Implication → Biconditional ↔ Compound Proposi\$ons: Nega\$on ༉  The negation of a proposition p is denoted by ¬p and has this truth table: p ¬p T F F T ༉  Example: If p denotes “The earth is round.”, then ¬p denotes “It is not the case that the earth is round,” or more simply “T...
View Full Document

## This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.

Ask a homework question - tutors are online