Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends

DOI10.1007/BF01979374zbMath0718.03028MaRDI QIDQ2639054

Alexandre A. Ivanov

Publication date: 1989

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187464

zbMATH Keywords

finite axiomatizabilitystrongly minimal theorygraphs and groups with a nonzero number of ends

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Model-theoretic algebra (03C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Axiomatic model classes (08C10) Categoricity and completeness of theories (03C35)

Related Items (1)

Cayley graphs having nice enumerations

Cites Work

• Unnamed Item
• Modelltheoretische Eigenschaften Endlichvalenter Graphen
• Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems

This page was built for publication: Problem of finite axiomatizability for strongly minimal theories of graphs and groups with a nonzero number of ends