Descriptive complexity of finite abelian groups

DOI10.1142/S0218196710006047zbMATH Open1209.03026MaRDI QIDQ3067786FDOQ3067786

Authors: Walid Gomaa 

Publication date: 13 January 2011

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Recommendations

• First-order queries on finite abelian groups
• Describing finite groups by short first-order sentences
• On the computational complexity of the theory of Abelian groups
• On distinguishing sets of structures by first-order sentences of minimal quantifier rank
• Descriptive complexity of finite structures: Saving the quantifier rank

zbMATH Keywords

definabilitydescriptive complexityabelian groupsexpressibilityEhrenfeucht-Fraïssé games

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Descriptive complexity and finite models (68Q19) Finite abelian groups (20K01)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• FINITE AXIOMATIZATION OF FINITE SOLUBLE GROUPS

Cited In (5)

• Descriptive complexity of finite structures: Saving the quantifier rank
• On the computational complexity of the theory of Abelian groups
• First-order queries on finite abelian groups
• A continuous model for systems of complexity 2 on simple abelian groups
• Count-free Weisfeiler-Leman and group isomorphism

This page was built for publication: Descriptive complexity of finite abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3067786)