Scribd
Upload
26 views4 pages

Homework 2

Uploaded by

Adrian Marin Jimenez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views4 pages

Homework 2

Uploaded by

Adrian Marin Jimenez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Mathematical Logic 2024–25

Week 2

1. Discuss whether the following always hold (prove or give a counterex-


ample):

(a) ∆ |= α and ∆ ⊆ Γ ⇒ Γ |= α;
(b) ∆, α |= β ⇔ ∆ |= α → β;
(c) ∆ |= α and Γ |= α ⇒ ∆ ∩ Γ |= α.

2. Use the Substitution Theorem to prove the following:

Proposition. Let α, β, γ be propositional formulas with β ≈ γ. Let α′


be the formula obtained from α by replacing all the occurrences of the
subformula β with γ. Then α ≈ α′ .

Guided solution. Consider the auxiliary operation α[p/β] whose effect


is the substitution of each occurrence of a formula β in α with the new
(i.e. not occurring in α) propositional variable p. (You may give a
recursive definition of α[p/β].) Notice that the formula (α[p/β])[β/p]
is just α. Then apply the Substitution Theorem to α[p/β], β and γ.
(Question: why do we require p being new?)

3. So far we have seen examples of one 0-ary connective (⊥), one 1-ary
connective (¬), and four binary connectives (∧, ∨, →, ↔), but there
are n-ary connectives, for each n ∈ N. What really matters is not
the symbol used to denote the connective, but rather its semantics.
For instance, the semantics of connective ∧ is given by the mapping
f∧ : {0, 1}2 → {0, 1} defined by f∧ (x, y) = min(x, y).
In general, an n-ary connective ♯ applies to n formulas α1 , . . . , αn and
returns a formula ♯(α1 , . . . , αn ). The truth value of the latter formula
depends on the truth values of α1 , . . . , αn according to a map f♯ :
{0, 1}n → {0, 1}, called the characteristic function of ♯. Map f♯ defines
the semantics of ♯.

Let n ∈ N. How many n-ary connectives are there? (Pay special


attention to the case n = 0: you will realize why ⊥ is not only an
atomic formula, but also a connective. Similarly, ⊤ := ¬ ⊥ is not only
a formula, but also a 0-ary connective.)

1
4. A formula φ Vis in Conjunctive Normal Form (briefly: CNF) if it is
of the form 1≤i≤n φi , where each φ is a disjunction of atomic or
negations of atomic formulas.
Give a criterion (i.e. a necessary and sufficient condition) for a formula
in CNF to be a tautology.
W
Hint. First establish a criterion for a formula of the form 1≤i≤n ψi ,
where each φi is an atomic or a negated atomic formula, to be a
tautology.
5. Exercises 1, 2, 13, 14 (see the warning below!), 15, pp. 27–29, in van
Dalen, Logic and structure, 4th ed.

Comment. In Exercise 13, ∥p∥v stands for v(p). The exercise deals
with the so called Cantor space, namely with the space C = {0, 1}N of
binary sequences, equipped with the product topology of the discrete
topology on {0, 1}. By Tychonoff Theorem, C is a compact space.
You are asked to prove that such space has a basis of clopen (i.e.
simultaneously open and closed) sets.
In addition to that, show that C is Hausdorff and totally disconnected,
the latter meaning that its only nonempty connected subsets are the
singletons.
A topological space which is compact, Hausdorff and admits a base of
clopen sets is called a Stone space.

Warning. Exercise 14 is not correctly formulated. Define the relation


< on the quotient set PROP/≈ as follows:
[φ] < [ψ] if |= φ → ψ and ̸|= ψ → φ,
where [α] denotes the equivalence class of formula α.
Show that relation < is
(a) well-defined;
(b) a partial ordering with least and greatest element. (In this course,
by a partial ordering on a set, we always mean an antireflexive
and transitive relation on such set.)
Then, in order to prove that < is a dense ordering, let [φ] < [ψ] and let
p be a propositional letter not occurring neither in φ nor in ψ. Show
that
[φ] < [φ ∨ (p ∧ ψ)] < [ψ].

2
Can you see why we need to pick p as suggested above?

6. Let p, q be propositional letters. Give an example of formulas φ, ψ1 , ψ2


such that (φ[ψ1 /p])[ψ2 /q] (this is the substitution operation defined in
class is applied twice) is not logically equivalent to φ[ψ1 /p, ψ2 /q] (this
is the simultaneous substitution–see Exercise 15, p. 29, in van Dalen).

The following “logical puzzles” are frequently found in newspapers,


magazines, on the web, etc. . . Try to solve them. You may use the
truth table method to argue in a systematic way. Of course, there are
different ways of solving them!

7. Andrew, Barbara and Charles plan to enter university. They are asked
what subject they will study. Here are their answers (we assume that
none of them is a liar):
Andrew: if Barbara or Charles will not study Law, I will do it.
Barbara: Charles will study Law.
Charles: not all of us will study Law.
Can you tell whether at least one of the three will study Law for sure?
If so, who?

8. In the Dichotomy county, the population is divided in two groups:


the T’s (who always say the truth) and the F’s (who always lie). Mr
Census is a census taker.

(a) Mr. Census asks Mr. White which group his and his wife belong
to.
Mr. White: we both belong to the F’s.
What is really the situation?
Hint: Mr. White belongs to the T’s if and only if his answer is
true.
(b) Same question as above to Mrs. Yellow.
Mrs. Yellow: If I belong to the T’s, then my husband too.
Is there any information that Mr. Census can derive from this
answer?
(c) Now Mr. Census asks Mr. and Mrs. Yellow whether they have
children.

3
Mrs. Yellow: If my husband belongs to the T’s, then we do have
children.
Mr. Yellow: If my wife belongs to the F’s, then we do have
children.
Help Mr. Census to fill in his questionnaire!
(d) Same question about children to Mr. and Mrs. Red.
Mr. Red: If I belong to the the T’s and my wife belong to the
F’s then we do have children.
Mrs. Red: What my husband says is false!
Mr. Census believes that the Reds have children. Is he right?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy