This preview shows page 1. Sign up to view the full content.
Unformatted text preview: G . Assume that G is a graph with innitely 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 innite 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
 Spring '09
 InessaEpstein
 Math

Click to edit the document details