In this paper, we study linear CNF formulas generalizing linear hypergraphs un-der combinatorial and complexity theoretical aspects w.r.t. SAT. We establish NP-completeness of SAT for the unrestricted linear formula class, and we show the equiv-alence of NP-completeness of restricted uniform linear formula classes w.r.t. SATand the existence of unsatisfiable uniform linear witne...