Abstract

Syntax and semantics of Propositional Logic are conventionally regarded as two distinct notions. We consider solely one notion, syntax, based on syntactic description of semantics of a 3CNF Boolean formula, generated via the Tseytin transformation. We use this novel approach to determine a sufficient condition for unsatisfiability.