3.6. Predicate Formulas 63
(a).:.D.Ben/_D.David/// !.L.Albert;Ben/^L.Ben;Albert//(b)8 x .xDClaire^:L.x;Emily//_.x¤Claire^L.x;Emily//^
8 x .xDDavid^L.x;Claire//_.x¤David^:L.x;Claire//(c)
:D.Claire/ !.G.Albert;Ben/^9xG.Ben;x//(d)
8 x 9 y 9 z .y¤z/^L.x;y/^:L.x;z/(e)How could you express “Everyone except for Claire likes Emily” using just
propositional connectiveswithoutusing any quantifiers ( 8 ; 9 )? Can you generalize
to explain howanylogical formula over this domain of discourse can be expressed
without quantifiers? How big would the formula in the previous part be if it was
expressed this way?
Problem 3.14.
The goal of this problem is to translate some assertions about binary strings into
logic notation. The domain of discourse is the set of all finite-length binary strings:
, 0, 1, 00, 01, 10, 11, 000, 001,.... (Heredenotes the empty string.) In your
translations, you may use all the ordinary logic symbols (including=), variables,
and the binary symbols 0 , 1 denoting 0, 1.
A string like 01 x 0 yof binary symbols and variables denotes theconcatenation
of the symbols and the binary strings represented by the variables. For example, if
the value ofxis 011 and the value ofyis 1111 , then the value of 01 x 0 yis the
binary string 0101101111.
Here are some examples of formulas and their English translations. Names for
these predicates are listed in the third column so that you can reuse them in your
solutions (as we do in the definition of the predicateNO-1Sbelow).
Meaning Formula Name
xis a prefix ofy 9 z .xzDy/ PREFIX(x;y)
xis a substring ofy 9 u 9 v .uxvDy/ SUBSTRING(x;y)
xis empty or a string of 0’s NOT.SUBSTRING. 1 ;x// NO-1S(x)