Many English sentences can be standardized into one of 4 different forms.
| All S are P | or (x)(Sx ⊃ Px) |
| No S are P | or (x)(Sx ⊃ ~Px) |
| Some S are P | or (∃x)(Sx • Px) |
| Some S are not P | or (∃x)(Sx • ~Px) |
Many translations can be done by first standardizing the English and then using the above symbolic template. For advice on standardization, see Chapter 4 (Categorical Propositions), Section 7.
English operators or connectives are mainly translated as in propositional logic. For advice on these translations see Chapter 6 (Propositional Logic), Section 1.
Note: In Sections 8.6 and 8.7, the text frequently drops ( ) in sequences where all the operators are the same.
For example, it will use
Fa • Ga • Ha instead of (Fa • Ga) • Ha.
When doing translation Exercises 8.6 and 8.7, LogicCoach will supply these missing { }.