Definability of linear equation systems over groups and rings

DOI10.2168/LMCS-9(4:12)2013zbMath1314.68147OpenAlexW3103648976WikidataQ58215482 ScholiaQ58215482MaRDI QIDQ2865066

Erich Grädel, Eryk Kopczyński, Anuj Dawar, Bjarki Holm, Wied Pakusa

Publication date: 28 November 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-9(4:12)2013

zbMATH Keywords

finite model theorydescriptive complexityPTIMElogics with algebraic operators

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Linear equations (linear algebraic aspects) (15A06) Descriptive complexity and finite models (68Q19)

Related Items

Choiceless Polynomial Time on Structures with Small Abelian Colour Classes, RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!, Unnamed Item