On Tarski's problem for virtually free groups
Abstract
We give a complete classification of finitely generated virtually free groups up to ∀∃-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and decides whether these groups have the same ∀∃-theory or not.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.