DMAT 201

SECOND PUBLIC EXAMINATION

Honour School of Mathematics: Paper B1
Honour School of Mathematics and Computation: Paper B1
Honour School of Mathematics and Philosophy: Paper B1
LOGIC AND SET THEORY
Thursday, 9 June 1994, 2.30 to 5.30

1. Let be the formula ( ), where , , and are well-formed formulae in the

propositional calculus. Show that is logically equivalent to
( ) ( ) ( ) ( ).
Hence, or otherwise, show that
(i) any formula obtained from by a permutation of , , and is logically equivalent
to ;
(ii) the formula ( ) is logically equivalent to .
The propositional language L has propositional letters p1 , p2 , . . . and the single connective
. For each n = 1, 2, . . . , let Sn be the set of all formulae in L that contain only
propositional letters drawn from p1 , . . . , pn .
Show that each formula in S2 is logically equivalent to one of p1 , p2 , p1 p1 , p1 p2 .
State how many equivalence classes (with respect to logical equivalence) there are in Sn
for n 1, and give a representative formula for each class.

Turn Over

2
2. Let S be a formal system for propositional calculus with the following properties:
(a) modus ponens is the only rule of inference of S;
(b) the deduction theorem holds for S;
(c) the following are theorems of S for any formulae and :
( ), ( ) (( ) ), .
The set of formulae is consistent if there is no formula for which `S and `S
and is inconsistent otherwise. Prove that, if is a consistent set of formulae and is any
formula, then
(i) { } is inconsistent if and only if `S ;
(ii) {} is inconsistent if and only if `S .
Now suppose that is a maximal consistent set in the sense that, for any formula not
in , {} is inconsistent. Show that, for formulae and ,
(iii) exactly one of and is in ;
(iv) `S if and only if `S or `S .
Deduce the existence of a valuation v such that v() = T if and only if .
Suppose that the propositional language used has countably many propositional letters,
p1 , p2 , . . . . Show that there are only countably many maximal consistent sets of formulae
that contain the set , where
= {pi pj : 1 i < j}.

3. Write down a formal system S of first-order predicate logic whose only rules of inference
are modus ponens and generalisation.
State and prove the deduction theorem for S.
Give a proof in S of
(z)(P (z, z) Q(z)) (x)((y)P (x, y) Q(x)).
[Properties of propositional calculus may be quoted without proof.]

DMAT 201

3
4. Let be a formula and a set of formulae in a first-order language with equality. What
is meant by saying is logically (universally) valid, and is a logical consequence of ?
[You may assume as understood what is meant by a formula being satisfied by a valuation
in an interpretation.]
Show that if is logically valid and is a logical consequence of (the set consisting of)
then is logically valid.
Suppose that the language contains a unary predicate letter P , and that is a formula
which does not involve P . Let A be the formula (x), and let B be (x)( P (x))
(x)P (x).
(i) Show that B is a logical consequence of A.
(ii) Show that, if is the formula (y)( x = y), then A is not a logical consequence of
B.
(iii) Suppose that is a formula such that B is logically valid. Let I be an interpretation
and let v be a valuation in I. Suppose further that, for every valuation w in I, P (x)
is satisfied by w if and only if w(x) 6= v(x). Show that is satisfied by v. Deduce
that A is logically valid.
Is A B a theorem of predicate calculus? Is B A? Explain your answers.
5. Determine which of the following statements of set theory are true and which are false.
(i) For any sets a and b, there exists a set c such that x c if and only if x a or x b.
(ii) There exists a set a which contains every set.
(iii) There exists a non-empty set a such that, for every x a, {x} a.
(iv) There exist sets a and b such that a b and b a.
[You may assume without proof the existence of the set of natural numbers with its usual
properties; you should otherwise give a careful statement of each axiom you use.]

DMAT 201

Turn Over

4
6. What is an inductive set? Describe how the set of natural numbers is defined within
set theory. Show that is inductive, and state and prove the Principle of Mathematical
Induction.
Prove that

n+ = n for each natural number n, where n+ denotes the successor of n.

A Peano system is a triple h N, S, e i, where N is a set, S: N N is a function, and e is

a member of N such that
(i) e does not belong to the range of S;
(ii) S is an injection;
(iii) if e A N and S(a) A whenever a A, then A = N .
Show that h , + , 0 i is a Peano system.
Prove that, for any Peano system h N, S, e i, there exists a bijection h of onto N such
that h(0) = e and h(n+ ) = S(h(n)) for each natural number n.

7. Let A be a set with a denumerable (countably infinite) subset B, and let C be a denumerable set with A C = . Prove that card (A C) = card (A).
Explain how to construct, given a denumerable sequence (xn )n of real numbers, a real
number y such that y 6= xn for each natural number n. Hence show that if A is a
denumerable set of real numbers, then there is a denumerable set B such that B R \ A.
Justifying any statements you make about the cardinalities of specific sets, prove that the
set of irrational real numbers has cardinality 20 .

8. Let h X, <X i be a well-ordered set, and let f : X X be an order preserving injection.

Show that x X f (x) for each x X and deduce that the range of f is not an initial
segment of X.
Now let h Y, <Y i also be a well-ordered set. Prove that either the two sets are isomorphic
(as well-ordered sets) or one is isomorphic to an initial segment of the other.
Prove that the Well-Ordering Principle is equivalent to the property (T):
(T) for any cardinals and , one of and holds.
[You may assume that, for any set A, there is an ordinal which is not dominated by A.]

DMAT 201