Looks like no one added any tags here yet for you.
Basic Symbols of Sentential Logic
All and only the following are _____:
The capital letters we use to symbolize atomic sentences, called atomic formulae or occasionally sentential letters: A, B, C, and so on (possibly with numeric subscripts).
The symbols for the logical connectives: &, ∨, →, and ¬.
The parentheses used to disambiguate the scope of the connectives: ( and ).
Expressions of Sentential Logic
Any finite sequence or string of basic symbols.
Formulae of Sentential Logic
Every atomic formula φ is a formula of sentential logic.
If φ is a formula of sentential logic, then so is ¬φ.
If φ and ψ are formulae of sentential logic, then so are each of the following:
(φ&ψ)
(φ∨ψ)
(φ→ψ)
An expression φ of sentential logic is a formula only if it can be constructed by finitely many applications of the first three rules.
Parse Tree Construction Rules
Subformula
A formula ψ is a subformula of a formula φ if and only if ψ appears (as a node) in the parse tree of φ.
Procedure for Reinserting Omitted Parentheses
First, insert parentheses around every occurrence of & and its two conjuncts, starting with the rightmost & and ending with the leftmost,
Next, insert parentheses in the same fashion for each ∨ and its two disjuncts, from rightmost occurrence first, to the leftmost occurrence last,
Finally, insert parentheses for each →, and its antecedent and consequent, from rightmost occurrence first, to the leftmost occurrence last,
As you follow this procedure, keep in mind that parentheses are never inserted around negations, and that a single parenthesis should never be inserted within another set, i.e., do not break up any existing pairs of parentheses with ones you insert.
Atmoic formulae
Logical connectives
Conjunction
Disjunction
Conditional
Negation
Logical operators
Idealizations
Compound
Truth-functional
Semantics
Meaning
Truth-values
Compound sentence
Compound formula
Symbolize
Translate
Conjuncts
Disjuncts
Inclusive
Exclusive
Conditional
Antecedent
Consequent
Unary
Binary
Main connective
Scope
Ambiguous
Basic symbols
Formula
Expression
Well-formed formula
Variables
Inductive
Semantics
Parse tree