{"id":"https://openalex.org/W7167258345","doi":"https://doi.org/10.48550/arxiv.2607.01671","title":"Self-Referential $K$-SAT and the Finite Analogue of G\u00f6del's Incompleteness Theorem","display_name":"Self-Referential $K$-SAT and the Finite Analogue of G\u00f6del's Incompleteness Theorem","publication_year":2026,"publication_date":"2026-07-02","ids":{"openalex":"https://openalex.org/W7167258345","doi":"https://doi.org/10.48550/arxiv.2607.01671"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.01671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.01671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.01671","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139990577","display_name":"Wen Fang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang, Wen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123739093","display_name":"Xianxian Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xianxian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139978937","display_name":"Jun Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029995222","display_name":"Jun Luo","orcid":"https://orcid.org/0000-0003-3339-5566"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luo, Jie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051874566","display_name":"Yongxin Tong","orcid":"https://orcid.org/0000-0002-5598-0312"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tong, Yongxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139980804","display_name":"Ke Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Ke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2838999927043915,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2838999927043915,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.11969999969005585,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.09040000289678574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45829999446868896},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.44350001215934753},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.43880000710487366},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.3901999890804291},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.38929998874664307},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.3864000141620636},{"id":"https://openalex.org/keywords/forcing","display_name":"Forcing (mathematics)","score":0.3783000111579895},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.37229999899864197},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.35899999737739563},{"id":"https://openalex.org/keywords/unital","display_name":"Unital","score":0.350600004196167}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6527000069618225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48539999127388},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45829999446868896},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.44350001215934753},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.38929998874664307},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.3864000141620636},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.3783000111579895},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C160873635","wikidata":"https://www.wikidata.org/wiki/Q17148807","display_name":"Unital","level":3,"score":0.350600004196167},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.33970001339912415},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C180937797","wikidata":"https://www.wikidata.org/wiki/Q200787","display_name":"G\u00f6del's incompleteness theorems","level":3,"score":0.29910001158714294},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.2928999960422516},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.27079999446868896},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2630000114440918},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.01671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.01671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.01671","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.01671","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Self-reference":[0],"and":[1,55,86,220],"solution":[2,32],"independence":[3],"are":[4,77],"core":[5],"properties":[6],"underlying":[7],"intractability.":[8],"This":[9,114],"paper":[10],"establishes":[11],"a":[12,38,50,62,96,106,158,181,189,222],"finite":[13,165],"combinatorial":[14],"analogue":[15],"of":[16,110,120,161,184,216],"G\u00f6del's":[17],"incompleteness":[18,163],"theorems":[19],"within":[20],"Boolean":[21],"$K$-SAT.":[22],"While":[23],"standard":[24],"random":[25],"$K$-SAT":[26],"has":[27],"assignment":[28],"correlations":[29],"that":[30,76,91,193],"disrupt":[31],"independence,":[33],"we":[34,70,89,187],"resolve":[35],"this":[36,142],"via":[37,79],"logarithmic-width":[39],"ensemble":[40],"($K":[41],"=":[42],"O(\\log":[43],"N)$).":[44],"Here,":[45],"satisfying":[46],"assignments":[47],"converge":[48],"to":[49,95,124,145,180,213],"Poisson":[51],"distribution,":[52],"letting":[53],"unsatisfiable":[54],"uniquely":[56],"satisfiable":[57],"formulas":[58],"coexist.":[59],"By":[60],"executing":[61],"single-clause":[63],"substitution":[64],"conditioned":[65],"on":[66,230],"the":[67,121,146,151,169,214],"unique":[68],"solution,":[69],"construct":[71],"structurally":[72],"irreducible":[73],"SAT/UNSAT":[74],"pairs":[75],"indistinguishable":[78],"local":[80,232],"evaluation.":[81],"Using":[82],"algorithmic":[83],"information":[84],"theory":[85],"Shannon":[87],"channels,":[88],"prove":[90],"deductive":[92],"pipelines":[93],"restricted":[94],"sublinear":[97],"window":[98],"suffer":[99],"from":[100,176],"an":[101,132],"informational":[102],"blind":[103],"spot,":[104],"forcing":[105],"descriptive":[107],"lower":[108],"bound":[109,143],"$K(\\mathcal{A})":[111],"\\geq":[112,129,137],"\u03a9(N^{1-\u03b4})$.":[113],"deficit":[115],"forces":[116],"any":[117],"Resolution":[118],"refutation":[119],"UNSAT":[122],"instance":[123,185],"utilize":[125],"wide":[126],"clauses":[127],"($w(\u03c0)":[128],"\u03a9(N^{1-\u03b4})$),":[130],"triggering":[131],"exponential":[133],"proof-tree":[134],"explosion":[135],"($S(\u03d5)":[136],"\\exp(\u03a9(N^{1-2\u03b4}))$).":[138],"As":[139],"$\u03b4\\rightarrow":[140],"0^+$,":[141],"converges":[144],"worst-case":[147],"$2^N$":[148],"threshold,":[149],"reframing":[150],"Strong":[152],"Exponential":[153],"Time":[154],"Hypothesis":[155],"(SETH)":[156],"as":[157],"direct":[159],"projection":[160],"G\u00f6del":[162],"onto":[164],"computation.":[166],"We":[167],"diagnose":[168],"decades-long":[170],"stagnation":[171],"in":[172],"complexity":[173],"theory.":[174],"Transitioning":[175],"Turing's":[177],"class":[178],"separation":[179],"G\u00f6delian":[182],"paradigm":[183],"indistinguishability,":[186],"introduce":[188],"multi-dimensional":[190],"comparative":[191],"framework":[192],"contrasts":[194],"these":[195],"two":[196],"historical":[197],"lineages":[198],"across":[199],"distinct":[200],"perspectives.":[201],"The":[202],"self-referential":[203],"hardness":[204],"exhibits":[205],"physical":[206],"invariance:":[207],"it":[208],"precludes":[209],"quantum":[210],"shortcuts":[211],"due":[212],"necessity":[215],"global":[217],"semantic":[218],"analysis":[219],"delineates":[221],"scaling":[223],"bottleneck":[224],"for":[225],"machine":[226],"learning":[227],"architectures":[228],"operating":[229],"lossy,":[231],"compression.":[233]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-04T00:00:00"}