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

Statement/Proposition
A sentence that is either True or False.

Statement Letters
Capital letters near the beginning of the alphabet, such as A, B, and C used to represent statements.

Logical Connectives
 Symbols used to represent and, or, then, if and only if...
 Used to connect statements.

Conjuction
The statement "A and B" expressed in symbolic form.

Conjuncts
The statements "A" and "B" in a conjunction.

Disjunction
The statement "A or B" expressed in symbolic form.

Disjuncts
The statements "A" or "B" in a disjunction.

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."

Antecedent
In an implication, "A implies B," statement A.

Consequent
In an implication, "A implies B," statement B.

Equivalence
 The statement expressed symbolically as, "(A implies B) AND (B implies A)."
 Also "if and only if"

Binary Connectives
Connectives that join 2 or more expressions together to produce a 3rd expression.

Unary Connective
A connective acting on 1 expression to produce a 2nd expression, such as a negation.

Negation
A unary connective for "not" in symbolic form.

WellFormed Formula/WFF
An expression that is a legitimate string, following correct syntax rules.

Main Connective
In a wellformed formula (wff) with a number of connectives, the connective to be applied last, following the order of precedence.

Tautology
A wellformed formula (wff) whose truth values are always True; it is True no matter what truth values are assigned to its statement letters.

Contradiction
A wellformed formula (wff) whose truth values are always False; it is False no matter what truth values are assigned to its statement letters.

Equivalent Wellformed Formulas (wffs)
Such as what happens in a wff that is also a tautology as in "P if and only if Q."

Algorithm
A set of instructions that can be mechanically executed in a finite amount of time in order to solve some problem.

Pseudocode
Algorithms written in natural language description that leave out the technical syntax of any given computer language.


