Book contents
- Frontmatter
- Contents
- Preface
- 1 Overview
- 2 Logical connectives and truth-tables
- 3 Conditional
- 4 Conjunction
- 5 Conditional proof
- 6 Solutions to selected exercises, I
- 7 Negation
- 8 Disjunction
- 9 Biconditional
- 10 Solutions to selected exercises, II
- 11 Derived rules
- 12 Truth-trees
- 13 Logical reflections
- 14 Logic and paradoxes
- Glossary
- Further reading
- References
- Index
2 - Logical connectives and truth-tables
- Frontmatter
- Contents
- Preface
- 1 Overview
- 2 Logical connectives and truth-tables
- 3 Conditional
- 4 Conjunction
- 5 Conditional proof
- 6 Solutions to selected exercises, I
- 7 Negation
- 8 Disjunction
- 9 Biconditional
- 10 Solutions to selected exercises, II
- 11 Derived rules
- 12 Truth-trees
- 13 Logical reflections
- 14 Logic and paradoxes
- Glossary
- Further reading
- References
- Index
Summary
LOGICAL CONNECTIVES
We shall look in more detail at each connective in the coming chapters, but here are our five sentential connectives:
if … then …
and
not
or
if and only if
Since we shall replace all English expressions with symbols in our logical language, here are the symbols we shall use to denote the connectives:
if … then … = →
and = &
not = ~
or = ∨
if and only if = ↔
The technical terms for these connectives are: material conditional or arrow (→), conjunction (&), negation (~), disjunction (∨), and biconditional (↔).
Simple sentences
A simple sentence is defined as one that contains none of our five connectives. So the following English sentences are all simple:
Bill is bald.
Fred is fat.
All men are fat.
Some people vote Liberal.
Since it would be unwieldy to keep repeating English sentences, we abbreviate simple sentences using capital letters. In each simple sentence we shall write one word in capital letters. The first letter of that word can then stand for the entire sentence in our symbolic notation. Thus, for example:
Bill is BALD = B
Fred is FAT = F
ALL men are fat = A
Some people vote LIBERAL = L
All sentences in our formal or symbolic language are called formulae. B, F, A and L are all simple or atomic formulae.
Complex sentences
Complex sentences are defined as those sentences that contain one or more of our five connectives.
- Type
- Chapter
- Information
- Elementary Logic , pp. 9 - 21Publisher: Acumen PublishingPrint publication year: 2012