The problem of finite axiomatizability for strongly minimal graph theories
DOI10.1007/BF01978722zbMATH Open0727.05028OpenAlexW2076222229MaRDI QIDQ803149FDOQ803149
Authors: A. A. Ivanov
Publication date: 1989
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/187471
Recommendations
- Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends
- scientific article; zbMATH DE number 554984
- Expressive power of finitely axiomatizable theories. I: Introduction, interpretations, and reductions to graphs
- Algebraic systems whose elementary theory is compatible with an arbitrary group
- Finite axiomatizability for profinite groups
finite axiomatizabilityfinitely-axiomatizable theoriesgraph theoriesgroups that act transitively on graphs of bounded valencystrongly minimal
Model-theoretic algebra (03C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Axiomatic model classes (08C10)
Cites Work
Cited In (8)
- Finitely axiomatizable quasivarieties of graphs
- An invariant for difference field extensions
- Non Σn axiomatizable almost strongly minimal theories
- Finitely axiomatizable strongly minimal groups
- Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends
- Automorphism groups of trivial strongly minimal structures
- Cayley graphs having nice enumerations
- STABILIZERS OF TRANSITIVE ACTIONS ON LOCALLY FINITE GRAPHS
This page was built for publication: The problem of finite axiomatizability for strongly minimal graph theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803149)