Answers to test yourself questions in Connectives handout.
a. L1.
a b
\ /
\ /
e
b. L2.
aa ab bb
\ / \ /
\ / \ /
a b
\ /
\ /
e
c. L3.
aaa aab abb bbb
\ / \ / \ /
\ / \ / \ /
aa ab bb
\ / \ /
\ / \ /
a b
\ /
\ /
e
2. What is the conjunction of a with b in each of the systems in 1?
- a
& b = e in each of the systems in 1.
3. In which of the systems in 1 is the conjunction of ab with bb defined? What is it for each system in which it is defined?
- L2
and L3. In both systems, ab & bb = b.
4. Is the conjunction of every pair of members of every Ln defined? Why or why not?
- Yes. The conjunction of every pair of members in every Ln is their longest common substring, which is always unique.
5. In which of the systems in 1 is the disjunction of a with b defined? What is it for each system in which it is defined?
- L2
and L3. In both systems, a | b is ab. In L1, both a and b are candidates, but neither is weaker than the other.
6. Is the disjunction of every pair of members of L defined? Why or why not?
- Yes. Let ahbi and ajbk be a pair of members of L, and let p = max(h, j) and q = max(i, k). Then ahbi | ajbk = apbq. On the other hand, for any sublanguage Ln, ahbi | ajbk is undefined if p+q is greater than n.
7. What is the negation of a in each of the systems in 1?
- In L1, ~a = b. In L2, ~a = bb. In L3, ~a = bbb.
8. In L2 and L3 the double negation of a is distinct from a. What is it in each case?
- In L2, ~~a = aa. In L3, ~~a = aaa.
a. M1
a b
\ /
\ /
e
b. M2
aa ab ba bb
\ /\ /\ /
\ / / \ \ /
\// \\/
a b
\ /
\ /
\ /
e
10. What is the conjunction of a with b in each of the systems in 9?
- a
& b = e in each of the systems in 9.
11. What is the conjunction of ab with bb in M2?
12. Why is the conjunction of ab with ba in M2 not defined?
- Both a and b are candidates, but neither is weaker than the other.
13. Why is the disjunction of a with b in M2 not defined?
- Both ab and ba are candidates, but neither is weaker than the other.
14. What is the negation of a in each of the systems in 9?
- In M1, ~a = b. In M2, ~a = bb.