arXiv (All)
open access
An Exponential Succinctness Gap between Three-Variable Logic and the Calculus of Relations
Three-variable first-order logic (FO3) and the calculus of relations (CoR) define the same binary queries, an equivalence going back to Tarski in the 1940s. While the classical translation $\text{FO3} \Rightarrow \text{CoR}$ is exponential, we prove that this blow-up is unavoidable, resolving a long
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
- Quantificational Logic and Empty Names#697471
- On Minimal Models for Pure Calculi of Names#746615
- Language, Form, and Logic: In Pursuit of Natural Logic's Holy Grail#112137
- The Conditional in Three-Valued Logic#74305
- The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation#998862
Record · ID 1062703
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