Question 1 Proposition 1. A graph X is 2-colorable if and only if it is bipartite. Proof. If a graph X is 2-colorable, we can color it using colors a and b. Grouping vertices of color a in A and those of color b in B, we obtain two sets inside which no two vertices are adjacent. Conversly, if X is Bipartite, we can group the vertices in sets A and B. Simply color all vertices of A with color a ...

It has been only a little more than a decade since a professional consensus emerged concerning the need to formulate an alternative to industrial arts. Few question the importance of technology education, or the need for a new name to characterize the program area. Technology education, however, is at a critical juncture. What can be questioned is the ability of the profession to clearly articu...

1. Logical language 1.1. Proposition, sentence and inscription Quine has argued in favor of the rejection of propositions. His argument can be summarized by the following syllogism: No entity without identity There is no criterion of identity for propositions No propositions Quine has been quite influential in the replacement of the expression propositional logic by the expression sentential lo...