Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups

DOI10.3103/S1066369X22010029OpenAlexW4312473198MaRDI QIDQ2112324

R. A. Farakhutdinov

Publication date: 10 January 2023

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x22010029

zbMATH Keywords

graphsemigroup of endomorphismsrelatively elementary definabilitysemiautomaton

Mathematics Subject Classification ID

Model theory (03Cxx) Combinatorics (05-XX) Lattices (06Bxx)

Cites Work

• Elementary equivalence of derivative structures of free lattices
• Elementary Equivalence of Derived Structures of Free Semigroups, Unars, and Groups
• Elementary classification and decidability of theories of derived structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relatively elementary definability of the class of universal graphic semiautomata in the class of semigroups