I define a homogeneous \–c.c. proper product forcing for adding many clubs of \ with finite conditions. I use this forcing to build models of \=\aleph _2\), together with \\) and \ large and with very strong failures of club guessing at \.

We formulate combinatorial principles that combine the square principle with various strong forms of the diamond principle, and prove that the strongest amongst them holds inLfor every infinite cardinal.As an application, we prove that the following two hold inL:1.For every infinite regular cardinalλ, there exists a special λ+-Aronszajn tree whose projection is almost Souslin;2.For every infinite cardinalλ, there exists arespectingλ+-Kurepa tree; Roughly speaking, this means that this λ+-Kurepa tree looks very much like the λ+-Souslin trees that Jensen constructed inL.

In his book on P max [7], Woodin presents a collection of partial orders whose extensions satisfy strong club guessing principles on ω | . In this paper we employ one of the techniques from this book to produce P max variations which separate various club guessing principles. The principle (+) and its variants are weak guessing principles which were first considered by the second author [4] while studying games of length ω | . It was shown in [1] that (...) the Continuum Hypothesis does not imply (+) and that (+) does not imply the existence of a club guessing sequence on ω | . In this paper we give an alternate proof of the second of these results, using Woodin's P max technology, showing that a strengthening of (+) does not imply a weakening of club guessing known as the Interval Hitting Principle. The main technique in this paper, in addition to the standard P m a x machinery, is the use of condensation principles to build suitable iterations. (shrink)