Yongxin Tong
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Algorithms×1Info Theory×1Logic×1
Frequent co-authors
Research Timeline
2026
Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem
This paper establishes a finite combinatorial version of Gödel's incompleteness theorems in Boolean $K$-SAT, resolving assignment correlations and constructing structurally irreducible SAT/UNSAT pairs.
Highlighted terms show continued research focus across papers
Papers
cs.CCcs.DScs.ITTheoreticalRecentJul 2, 2026
Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem
Wen Fang, Xianxian Li, Jun Liu, Jie Luo +2 more
This paper establishes a finite combinatorial version of Gödel's incompleteness theorems in Boolean $K$-SAT, resolving assignment correlations and constructing structurally irreducible SAT/UNSAT pairs…
View →