I will discuss Fields Outline of a Theory of Truth. I will point out important properties of Kripkeleast fixed points constructions and theory. I do this not to demean Field’s superb work on truth but rather to suggest that there may be no really satisfactory conditional connective for languages containing their own truth predicates.

We prove the determinacy of all Δ 1 1 games on arbitrary trees, and we use this result and the assumption that a measurable cardinal exists to demonstrate the determinacy of all games on ω ω that belong both to – Π 1 1 and to its dual.

We show that Blackwell determinacy in L(R) implies determinacy in L(R).