Consider an axiomatic system that consists of elements in a set
S and a set P...
Consider an axiomatic system that consists of elements in a set
S and a set P of pairings of elements (a, b) that satisfy the
following axioms:
A1 If (a, b) is in P, then (b, a) is not in P.
A2 If (a, b) is in P and (b, c) is in P, then (a, c) is in
P.
Given two models of the system, answer the questions below.
M1: S= {1, 2, 3, 4}, P= {(1, 2), (2,...
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C...
2. Let A = {p, q, r, s}, B = {k, l, m, n}, and C = {u, v, w},
Define f : A→B by f(p) = m, f(q) = k, f(r) = l, and f(s) = n, and
define g : B→C by g(k) = v, g(l) = w, g(m) = u, and g(n) = w. Also
define h : A→C by h = g ◦ f. (a) Write out the values of h. (b) Why
is it that...
I had a discussion question that follows:
What is wrong with the following argument? Note the...
I had a discussion question that follows:
What is wrong with the following argument? Note the argument
supposedly shows that any symmetric and transitive relation R on A
must also be reflexive.
Let R be a relation in A × A that is symmetric and transitive.
Using symmetry, if (x,y) ∈ R then (y,x) ∈ R. Hence, both (x,y) and
(y,x) are in R. Since (x,y) and (y,x) ∈ R, by transitivity, we have
(x,x) ∈ R. Therefore, R is...
Consider permutations of the 26-character lowercase alphabet
Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}.
In how many of these permutations do
a,b,c...
Consider permutations of the 26-character lowercase alphabet
Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}.
In how many of these permutations do
a,b,c occur consecutively and in that
order?
In how many of these permutations does a appear before
b and b appear before c?