Study your flashcards anywhere!

Download the official Cram app for free >

  • Shuffle
    Toggle On
    Toggle Off
  • Alphabetize
    Toggle On
    Toggle Off
  • Front First
    Toggle On
    Toggle Off
  • Both Sides
    Toggle On
    Toggle Off
  • Read
    Toggle On
    Toggle Off
Reading...
Front

How to study your flashcards.

Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key

Up/Down arrow keys: Flip the card between the front and back.down keyup key

H key: Show hint (3rd side).h key

A key: Read text to speech.a key

image

Play button

image

Play button

image

Progress

1/29

Click to flip

29 Cards in this Set

  • Front
  • Back
SATISFIABLE STAEMENTS
AT LEASTS ONE CASE IS TRUE!
SATISFIABILITY OF SETS OF STATEMENTS
AT LEAST ONE TRUE CASE IN A ROW
vALIDITY OF INTERENCES
CONCLUSION IS T AND HTERE ARE NO CONUTEREXPAMPOES
VALIDITY OF STATEMENTS
VALID STATEMENT IS A TAUTOLOGY ALL T
SOUNDNESS
VALID WITH ALL TRUE PREMISES
IDEMPOTANCE
& OR t, f, [,,]
DOESNT CHANGE HTE TRUTH VALUES
CONTRADICTION/ TAUTOLOGY
VALUESA RE:
TAUTOLOGY IS VALID, COUNTRAD. IS INVALID
TRUTH FUNCTIONAL EQUIV --
SAME TRUTH VALUES
WEAK STAEMENTS
ALL TRUE!
STRONG STATEMENTS
ALL FALSE
REDUC TREE
AS A TEST FOR VALIDIY
1 - NAGATE CONCLUSION
2 - DO TREE .. SEE IF ALL PATHS CLOOSE.. THEN ITS VALID!
REDUC TREE
AS A TEST FOR TAUTOLOGIES
NEGATE STATEMENTMENT
IF ALL PATHS CLOSE THEN ITSA TAUTOLOGY
REDUC TREES AS A TEST FOR SATISFIABILITY
DO IT AND SEE IF THERE IS AN OPEN PATH. IF U HAVE ONE OPEN PATH THEN ITS SATISFIABLE
AS A TEST FOR CONTRADICTIONS
IF ALL PATHS CLOSE ITS NOTMAL.. IF THERE OPEN THERE IS A CONTRADICTION
DEDUCTION TREES
AS VALIDITY TEST FROM INTERERCE
TAKE CONCLU TO THE BOTTOM ADN USE PREM AND REDUCE AS USUAL.
DEDUCTION TREES AS A TEST FOR TAUTOLOGIES
BUILD FROM NOTHING .. IF ALL PATHS LEAD TO STATEMENT THEN ITS A TAUTOLOGY
DEDUCTION TREE AS A TEST FOR CONTRADICTION
DENY STATEMENT .. TREAT LIKE TAUTOLOGY.. SO BUILD TREE PATH TO STATEMENT IT WORKS
COMPLETE DISJ. NORMAL FORM
USE TABLE .. LOOK FOR ALL T'S .. THEN USE AND SO ITS LIEK A& -b.. BUT THEN CONVERY SO ITS AB WITH LINE OVER B
COMMUTATIVITY
p * q = q * p
ASSOCIATIVITY
A v (B&C) = (AVB) &C
TRANSLATION OF STATEMENTS INTO EQUIV.
USE ADN OR NOT TO COMPARE
TESTUING FOR EXPRESSIVE COIMPLETE
1... -a
2... aVB OR A&B
NOR <--- (DOWN)
A B
T F T
T F F
F F F
F T F

EQUAL TO -(aVb)
NAND /
F
T
T
T

EQUAL TO -(a&b)
BRACKET
[A,B,C)
T
T
T
F
F
F
T
F
UNLESS
IF NOT!!!
B UNLESS A
- a --> B
A --> B
T
F
T
T
A <--> B
T
F
F
T
A ONLY IF B
A --> B