arXiv (All)
open access
Self-Referential $K$-SAT and the Finite Analogue of Gödel's Incompleteness Theorem
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ödel's incompleteness theorems. Solution independence is formalized via factorial moments of the satisfying-assignment c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Epistemically possible worlds and propositions#776992
- Finite Spectra of Syllogistic Logic with Cardinality Comparisons#1051299
- Incompleteness and Computability: An Open Introduction to Gödel's Theorems#721836
- A Catalogue of Properties of Binary Relations: Entailments, Incompatibilities, and Independence Results#1071119
- A Dynamic Epistemic Logic with a Knowability Principle#711411
Record · ID 1048722
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive