Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem

Wen Fang, Xianxian Li, Jun Liu +3

Self-reference and solution independence are central to hard combinatorial instances. We ask whether Boolean \(K\)-SAT can exhibit both, giving a finite propositional analogue of G…