arXiv (All)
open access
Model Theory and Algorithms for One-Relator Groups
We study the elementary theories and algorithmic properties of one-relator groups. We give a first-order sentence characterizing Baumslag-Solitar-freeness in this class. For fixed $|m|>1$, we regularly interpret $\BS(1,m)$ as a definable subgroup in every one-relator group containing it. We uniforml
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 remark about the description of free products of groups#490077
- A counterexample to Petrykowski's conjecture#972761
- The theory of nonabelian free groups has no model companion#1050513
- Asymptotic classes via definable quotients#1341498
- Positive cones and bi-orderings on almost-direct products of free groups#128255
Record · ID 1400135
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