09ma6cHW3

# 09ma6cHW3 - G Assume that G is a graph with inﬁnitely...

This preview shows page 1. Sign up to view the full content.

Ma/CS 6c Assignment #3 Due Wednesday, April 21 at 1 p.m. (35%) 1. (i) Prove that {⇔ , ∧} , {⇔ , ∨} are not complete. (ii) Prove that | , are the only complete binary connectives. (iii) Prove that, “If ... , then ... , else ... ” is not complete, but if we add to it the constants 0,1 it becomes complete. (35%) 2. Let G be a graph with set of vertices V . A coloring of G with k colors ( k = 1 , 2 ,... ) is a map c : V → { 1 , 2 ,...,k } so that if x,y V are adjacent, then c ( x ) 6 = c ( y ). By a ﬁnite subgraph of G we mean a graph consisting of ﬁnitely many vertices of G , with two such vertices adjacent iﬀ they are adjacent in
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: G . Assume that G is a graph with inﬁnitely many vertices V = { x 1 ,x 2 ,x 3 ,... } . Show that if every ﬁnite subgraph of G has a coloring with k colors, then G has a coloring with k colors. (30%) 3 * . Let { A 1 ,A 2 ,A 3 ,... } be an inﬁnite set of formulas in propositional logic. Assume that for every valuation v there is some n (depending on v ) such that v ( A n ) = 1. Show then that there is some ﬁxed m with A 1 ∨ A 2 ∨ ··· ∨ A m a tautology. 1...
View Full Document

## This note was uploaded on 07/19/2010 for the course MA 6 taught by Professor Inessaepstein during the Spring '09 term at Caltech.

Ask a homework question - tutors are online