We prove the following consistency results about indescribable cardinals which answer a question of A. Kanamori and M. Magidor .Theorem 1.1 . CON.Theorem 5.1 . Assuming the existence of σmn indescribable cardinals for all m < ω and n < ω and given a function : {: m 2, n } 1} → {0,1} there is a poset P L[] such that GCH holds in P and Theorem 1.1 extends the work begun in [2], and its proof uses an iterated (...) forcing construction together with master condition arguments. By combining these techniques with some observations about small forcing and indescribability, one obtains the Easton-style result 5.1. (shrink)