We propose a new perspective on propositional clause sets and on that basis we investigate (new) polynomial time SAT-testable classes. Moreover, we study autarkies using a closure concept. A specific simple type of closures the free closures leads to a further formula class called hyperjoins that is studied w.r.t. SAT
