The purpose of this paper is to develop a class of semantic tableau systems for some counterfactual logics. All in all I will discuss 1024 systems. Possible world semantics is used to interpret our formal languages. Soundness results are obtained for every tableau system and completeness results for a large subclass of these.