This page informally describes our sentential language which we name${\displaystyle {\mathcal{L}}_{\mathcal{S}}}$. A more formal description will be given inFormal Syntax andFormal Semantics

Sentences in${\displaystyle {\mathcal{L}}_{\mathcal{S}}}$ are represented assentence letters, which are single letters such as${\displaystyle \mathrm{P},\mathrm{Q},\mathrm{R},}$ and so on. Some texts restrict these to lower case letters, and others restrict them to capital letters. We will use capital letters.

Intuitively, we can think of sentence letters as English sentences that are either true or false. Thus,${\displaystyle \mathrm{P}}$ may translate as 'The Earth is a planet' (which is true), or 'The moon is made of green cheese' (which is false). But${\displaystyle \mathrm{P}}$ may not translate as 'Great ideas sleep furiously' because such a sentence is neither true nor false. Translations between English and${\displaystyle {\mathcal{L}}_{\mathcal{S}}}$ work best if they are restricted to timelessly true or falsepresent tense sentences in theindicative mood. You will see in thetranslation section below that we do not always follow that advice, wherein we present sentences whose truth or falsity is not timeless.

Sentential connectives are special symbols in Sentential Logic that represent truth functional relations. They are used to build larger sentences from smaller sentences. The truth or falsity of the larger sentence can then be computed from the truth or falsity of the smaller ones.

${\displaystyle \text{Conjunction:}\wedge }$

• Translates to English as 'and'.
• ${\displaystyle \mathrm{P}\wedge \mathrm{Q}}$ is called aconjunction and${\displaystyle \mathrm{P}}$ and${\displaystyle \mathrm{Q}}$ are itsconjuncts.
• ${\displaystyle \mathrm{P}\wedge \mathrm{Q}}$ is true if both${\displaystyle \mathrm{P}}$ and${\displaystyle \mathrm{Q}}$ are true—and is false otherwise.
• Some authors use an& (ampersand),• (heavy dot) or juxtaposition. In the last case, an author would write

${\displaystyle \mathrm{P}\mathrm{Q}}$

instead of our

${\displaystyle \mathrm{P}\wedge \mathrm{Q}.}$

${\displaystyle \text{Disjunction:}\vee }$

• Translates to English as 'or'.
• ${\displaystyle \mathrm{P}\vee \mathrm{Q}}$ is called adisjunction and${\displaystyle \mathrm{P}}$ and${\displaystyle \mathrm{Q}}$ are itsdisjuncts.
• ${\displaystyle \mathrm{P}\vee \mathrm{Q}}$ is true if at least one of${\displaystyle \mathrm{P}}$ and${\displaystyle \mathrm{Q}}$ are true—is false otherwise.
• Some authors may use a vertical stroke:|. However, this comes from computer languages rather than logicians' usage. Logicians normally reserve the vertical stroke for nand (alternative denial). When used as nand, it is called theSheffer stroke.

${\displaystyle \text{Negation:}\mathrm{\neg }}$

• Translates to English as 'it is not the case that' but is normally read 'not'.
• ${\displaystyle \mathrm{\neg }\mathrm{P}}$ is called anegation.
• ${\displaystyle \mathrm{\neg }\mathrm{P}}$ is true if${\displaystyle \mathrm{P}}$ is false—and is false otherwise.
• Some authors use~ (tilde) or−. Some authors use an overline, for example writing

${\displaystyle \overline{\mathrm{P}}\text{and}(\overline{(\mathrm{P}\wedge \mathrm{Q})}\vee \mathrm{R})}$

instead of

${\displaystyle \mathrm{\neg }\mathrm{P}\text{and}(\mathrm{\neg }(\mathrm{P}\wedge \mathrm{Q})\vee \mathrm{R}).}$

${\displaystyle \text{Conditional:}\to }$

• Translates to English as 'if...then' but is often read 'arrow'.
• ${\displaystyle \mathrm{P}\to \mathrm{Q}}$ is called aconditional. Itsantecedent is${\displaystyle \mathrm{P}}$ and itsconsequent is${\displaystyle \mathrm{Q}}$.
• ${\displaystyle \mathrm{P}\to \mathrm{Q}}$ is false if${\displaystyle \mathrm{P}}$ is true and${\displaystyle \mathrm{Q}}$ is false—and true otherwise.
• By that definition,${\displaystyle \mathrm{P}\to \mathrm{Q}}$ is equivalent to${\displaystyle (\mathrm{\neg }\mathrm{P})\vee \mathrm{Q}}$
• Some authors use⊃ (hook).

${\displaystyle \text{Biconditional:}\leftrightarrow }$

• Translates to English as 'if and only if'
• ${\displaystyle \mathrm{P}\leftrightarrow \mathrm{Q}}$ is called abiconditional.
• ${\displaystyle \mathrm{P}\leftrightarrow \mathrm{Q}}$ is true if${\displaystyle \mathrm{P}}$ and${\displaystyle \mathrm{Q}}$ both are true or both are false—and false otherwise.
• By that definition,${\displaystyle \mathrm{P}\leftrightarrow \mathrm{Q}}$ is equivalent to the more verbose${\displaystyle (\mathrm{P}\wedge \mathrm{Q})\vee ((\mathrm{\neg }\mathrm{P})\wedge (\mathrm{\neg }\mathrm{Q}))}$. It is also equivalent to${\displaystyle (\mathrm{P}\to \mathrm{Q})\wedge (\mathrm{Q}\to \mathrm{P})}$, the conjunction of two conditionals where in the second conditional the antecedent and consequent are reversed from the first.
• Some authors use≡.

Parentheses${\displaystyle (}$ and${\displaystyle )}$ are used for grouping. Thus

${\displaystyle ((\mathrm{P}\wedge \mathrm{Q})\to \mathrm{R})}$

${\displaystyle (\mathrm{P}\wedge (\mathrm{Q}\to \mathrm{R}))}$

are two different and distinct sentences. Each negation, conjunction, disjunction, conditional, and biconditionals gets a single pair or parentheses.

(1) Anatomic sentence is a sentence consisting of just a single sentence letter. Amolecular sentence is a sentence with at least one sentential connective. Themain connective of a molecular formula is the connective that governs the entire sentence. Atomic sentences, of course, do not have a main connective.

(2) The⊃ and≡ signs for conditional and biconditional are historically older, perhaps a bit more traditional, and definitely occur more commonly inWikiBooks andWikipedia than our arrow and double arrow. They originate withAlfred North Whitehead andBertrand Russell inPrincipia Mathematica. Our arrow and double arrow appear to originate withAlfred Tarski, and may be a bit more popular today than the Whitehead and Russell's⊃ and≡.

(3) Sometimes you will see people reading our arrow asimplies. This is fairly common inWikiBooks andWikipedia. However, most logicians prefer to reserve 'implies' for metalinguistic use. They will say:

If P then Q

or even

P arrow Q

They approve of:

'P' implies 'Q'

but will frown on:

P implies Q

Consider the following English sentences:

If it is raining and Jones is out walking, then Jones has an umbrella.

If it is Tuesday or it is Wednesday, then Jones is out walking.

To render these in${\displaystyle {\mathcal{L}}_{\mathcal{S}}}$, we first specify an appropriate English translation for some sentence letters.

${\displaystyle \mathrm{P}:}$ It is raining.

${\displaystyle \mathrm{Q}:}$ Jones is out walking.

${\displaystyle \mathrm{R}:}$ Jones has an umbrella.

${\displaystyle \mathrm{S}:}$ It is Tuesday.

${\displaystyle \mathrm{T}:}$ It is Wednesday.

We can now partially translate our examples as:

${\displaystyle \text{If}\mathrm{P}\text{and}\mathrm{Q},\text{then}\mathrm{R}}$

${\displaystyle \text{If}\mathrm{S}\text{or}\mathrm{T},\text{then}\mathrm{Q}}$

Then finish the translation by adding the sentential connectives and parentheses:

${\displaystyle ((\mathrm{P}\wedge \mathrm{Q})\to \mathrm{R})}$

${\displaystyle ((\mathrm{S}\vee \mathrm{T})\to \mathrm{Q})}$

For English expressions, we follow the logical tradition of using single quotes. This allows us to use ' 'It is raining' ' as a quotation of 'It is raining'.

For expressions in${\displaystyle {\mathcal{L}}_{\mathcal{S}}}$, it is easier to treat them as self-quoting so that the quotation marks are implicit. Thus we say that the above example translates${\displaystyle \mathrm{S}\to \mathrm{P}}$ (note the lack of quotes) as 'If it is Tuesday, then It is raining'.

• Book:Formal Logic