arXiv (All)
open access
Compactness Principles for CSPs and the Axiom of Chocie
We can associate a compactness principle $\mathcal K_{\mathcal{D}}$ to the Constraint Satisfaction Problem (CSP) with constraint library $\mathcal{D}$. These principles were studied by Katáy, Tóth, and Vidnyánszky and by Rorabaugh, Tardif, and Wehlau. We expand their work comparing the strength of $
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
- A Reality Check of Language Models as Formalizers on Constraint Satisfaction Problems#635591
- A Reality Check of Language Models as Formalizers on Constraint Satisfaction Problems#633242
- Feasible disjunction for random resolution#997605
- Proving Completeness in Kripke 1959’s Thesis via Banach-Tarski Decomposition and Incompleteness of Kripke’s Semantics with Th-Framework#728729
- A Lean 4 Formalization of Scott's Continuous Lattices (1972)#974478
Record · ID 1118946
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