Algebraic systems whose elementary theory is compatible with an arbitrary group (Q761534)

The graphs considered here have no loops and multiple edges. If A is a graph, Lt(A) is the set composed of A and all finite subgraphs of A. Lt(A) is a distributive algebraic lattice; moreover, Aut(A)\(\cong Aut(Lt(A))\). The author constructs for every connected non-countable graph A, a connected graph Gr(A) such that: (i) A and Gr(A) have the same cardinality and Aut(A)\(\cong Aut(Gr(A))\), (ii) if A, B are connected non- countable graphs, then the elementary theories of Gr(A) and Gr(B) coincide and the elementary theories of LT(Gr(A)) and LT(Gr(B)) coincide. Since for every group G there is a connected non-countable graph A such that \(G\cong Aut(A)\), the elementary theory of Gr(A) (LT(Gr(A))), for all connected non-countable graphs A is compatible with any group.