Formal Logic 1.1

The flashcards below were created by user eaavendano on FreezingBlue Flashcards.

  1. Statement/Proposition
    A sentence that is either True or False.
  2. Statement Letters
    Capital letters near the beginning of the alphabet, such as A, B, and C used to represent statements.
  3. Logical Connectives
    • Symbols used to represent and, or, then, if and only if...
    • Used to connect statements.
  4. Conjuction
    The statement "A and B" expressed in symbolic form.
  5. Conjuncts
    The statements "A" and "B" in a conjunction.
  6. Disjunction
    The statement "A or B" expressed in symbolic form.
  7. Disjuncts
    The statements "A" or "B" in a disjunction.
  8. Implication
    • A statement in the form "If statement A, then statement B."
    • Expressed in symbolic form, read as "A implies B."
    • Conveys meaning, "The truth of A implies or leads to the truth of B."
  9. Antecedent
    In an implication, "A implies B," statement A.
  10. Consequent
    In an implication, "A implies B," statement B.
  11. Equivalence
    • The statement expressed symbolically as, "(A implies B) AND (B implies A)."
    • Also "if and only if"
  12. Binary Connectives
    Connectives that join 2 or more expressions together to produce a 3rd expression.
  13. Unary Connective
    A connective acting on 1 expression to produce a 2nd expression, such as a negation.
  14. Negation
    A unary connective for "not" in symbolic form.
  15. Well-Formed Formula/WFF
    An expression that is a legitimate string, following correct syntax rules.
  16. Main Connective
    In a well-formed formula (wff) with a number of connectives, the connective to be applied last, following the order of precedence.
  17. Tautology
    A well-formed formula (wff) whose truth values are always True; it is True no matter what truth values are assigned to its statement letters.
  18. Contradiction
    A well-formed formula (wff) whose truth values are always False; it is False no matter what truth values are assigned to its statement letters.
  19. Equivalent Well-formed Formulas (wffs)
    Such as what happens in a wff that is also a tautology as in "P if and only if Q."
  20. Algorithm
    A set of instructions that can be mechanically executed in a finite amount of time in order to solve some problem.
  21. Pseudocode
    Algorithms written in natural language description that leave out the technical syntax of any given computer language.
Author:
eaavendano
ID:
121677
Card Set:
Formal Logic 1.1
Updated:
2011-12-08 02:27:02
Tags:
statements symbolic representation tutologies
Folders:

Description:
Statements, Symbolic Representation, and Tautologies
Show Answers: