arXiv (All)
open access
The failure of stable composition for equivalence relations in simple theories
Casanovas and Potier proved that algebraic quantification preserves stability of formulas. They also gave a nonsimple example, answering a question of Laskowski, showing that the algebraicity hypothesis cannot simply be replaced by NFCP, and asked whether a similar example exists in a simple theory.
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
- The commonly ignored aspects of the history of symmetries. Their link with intuitionist logic#709500
- Relative Locations#697477
- The ∇U Spectrum: On the Ontological Threshold of Reality and the Limits of Stabilized Form#91157
- Compact Quantitative Equational Theories as Monad Restrictions#1297553
- Models as signs: extending Kralemann and Lattman’s proposal on modeling models within Peirce’s theory of signs#735461
Record · ID 1399907
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