Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
4 Cards in this Set
- Front
- Back
|
What is a string? |
1. String: any finite sequence of sentence symbols, connectives, parentheses from L |
|
|
What is a well-formed formula?
|
A wff is a string constructed by the following rules: 1) a string of a single sentence symbol in L 2) If B is a wff, then ¬B is a wff 3) If B and C are wff, then (B & C), (B v C), (B -> C) and (B<->C) are all wff 4) Nothing else is a wff |
|
|
Steps of Induction
|
1) Basic step (Base Case): it's identified that certain objects have a desired characteristic 2) Inductive step: a complex of those objects inherit that characteristic based on the ways in which that complex may be formed 3) Concluding: determines that there are no ways in which the complex could be created such that it wouldn't inherit that characteristic. |
|
|
|
|
