arXiv (All)open access
Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem
computational complexity, data structures and algorithms, information theory, logic in computer science
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1048722
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.