The Language of Predicate Logic
[22/95%]For each of the following formulas, determine which occurrences of variables in them are free and which are bound (and by which quantifier). Here is a three-place predicate symbol.
;
;
;
.
For each formula from the previous problem, determine which of the following substitutions are possible: . Explain why. In the cases where it is possible, find the result of the substitution. Consider the formula:
(a) from problem 121;
(b) from problem 121;
(c) from problem 121;
(d) from problem 121.
Using the signature from example 27 on p. 140 — the two-place predicate symbols ("to be a parent of," so means " is a parent of ") and ("to be married to," means " is married to "), and the one-place predicate symbol ("to be male") — write formulas meaning:
is a grandson of ;
has at least two children;
and have one common child;
has an unmarried sister;
and are cousins;
is married, and only one of his sons is married.
The domain includes only the real numbers and the one-place infinitely differentiable functions on the set . The signature contains the three-place predicate symbol says "the value of the function at the argument equals "; and the two-place symbol , where means " is the derivative of ". Write formulas denoting the following. You may build auxiliary formulas and use ones constructed earlier:
is a number;
is a function;
is a constant function;
is a function identically equal to zero;
;
is the identity function;
;
is the exponential ;
for numbers ;
— for numbers ;
is a non-negative number;
the number is less than the number ;
the function takes all real values;
the function is one-to-one;
the function is sine;
the number equals ;
the number is a natural number.
Write formulas with free variables from that are true in elementary arithmetic of natural numbers if and only if
is an even number;
and are relatively prime;
lies in the interval between and ;
is the greatest common divisor of and ;
is the least common multiple of all numbers in the interval .
Let the signature contain two predicate symbols and . Tarski's geometry is the interpretation whose domain is the set of points in the Euclidean plane, means that the points , and lie on one line and in exactly that order ( between and ; not necessarily distinct), and means that the lengths of the segments and are equal.
Write formulas with free variables from the set that are true in Tarski's geometry if and only if
, and form a triangle;
is the midpoint of the segment ;
the ray is the bisector of the angle ;
the angle is a right angle;
the points lie on one circle;
the triangle is acute;
the segment is shorter than ;
the point lies inside the circle with center and a point lying on it.
Represent each of the following sentences by a formula of predicate logic, defining in each case a suitable signature.
Not all students study both analysis and history.
Only one student did not take the discrete mathematics exam.
Only one student passed all exams with 100 points.
The maximum score obtained in discrete mathematics exceeds the maximum score obtained in computer science.
There is a barber who shaves only those residents of the town who do not shave themselves.
There are politicians who can fool all the people some of the time; there are politicians who can fool some people all the time; but no one can fool all the people all the time.
Write a formula of predicate logic that is true only in interpretations whose domain contains one element (two, three, ..., elements).
Write a formula of predicate logic that is true only in interpretations in which the -place relation represents a function.
Determine which of the following formulas are true in elementary arithmetic, and explain what they mean:
;
;
;
;
.
Determine which of the following formulas are true in Tarski's geometry (problem 126 on the opposite page), and explain what they mean:
;
;
;
;
.
The signature is taken from example 28 on p. 141 — the three-place predicate symbol , where means "the value of the function at the argument equals ," and the two-place predicate symbol , where means " is the derivative of "; the interpretation consists of real numbers and infinitely differentiable functions on them. Determine which of the following formulas are true in this interpretation, and explain what they mean:
;
;
;
;
.
The signature consists of the two-place predicate symbol , the individual variables , and others. The interpretation is depicted in fig. 16; an arrow from to means that (such interpretations are called graphs; they will be studied in detail in chapter 9 and beyond). Determine which of the following formulas are true in this interpretation, and explain what they mean:
Fig. 16. The graph \mathfrak {G} from problem 133.
;
;
;
;
;
;
.
Prove theorem 43 on p. 150 (the Principle of Replacement for predicate logic): if is an -place predicate symbol, the formulas and have no free variables besides possibly , and , then for every formula .
Prove the remaining equivalences from theorem 44 on p. 150: for any variable and any formulas such that has no free occurrences of ,
-
;
-
;
-
;
-
;
-
;
-
;
-
. The source text already proves 1), 4), and 7) as worked examples; this problem asks for the remaining ones: 2), 3), 5), 6).
Prove the equivalences from theorem 47 on p. 155:
-
;
-
;
-
;
-
.
Prove the following equivalences:
;
;
;
.
Prove the entailments from theorem 48 on p. 155:
-
;
-
;
-
.
Give the remaining examples showing that the entailments from theorem 48 on p. 155 — 1) , 2) , 3) — do not hold in the reverse direction. (Example 34 already gives a counterexample for the first: on the interpretation with domain and one-place predicate symbols , meaning "odd" and "even" respectively, the formula is true while is false. The remaining examples asked for here are for 2) and 3).)
Prove the entailment . Show that the entailment does not hold in the reverse direction.
Bring the following formulas to prenex form, is a two-place predicate symbol:
;
;
.
Using transformations, prove the following equivalences, where the formula does not contain the variable free:
;
;
.