Definability of linear equation systems over groups and rings
From MaRDI portal
Publication:4649548
DOI10.4230/LIPICS.CSL.2012.213zbMATH Open1252.03083arXiv1204.3022OpenAlexW2067063705MaRDI QIDQ4649548FDOQ4649548
Authors: Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczyński, Wied Pakusa 
Publication date: 22 November 2012
Abstract: Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixed-point logic with counting. They also provide natural candidates for a separation of polynomial time from rank logics, which extend fixed-point logics by operators for determining the rank of definable matrices and which are sufficient for solvability problems over fields. Based on the structure theory of finite rings, we establish logical reductions among various solvability problems. Our results indicate that all solvability problems for linear equation systems that separate fixed-point logic with counting from PTIME can be reduced to solvability over commutative rings. Moreover, we prove closure properties for classes of queries that reduce to solvability over rings, which provides normal forms for logics extended with solvability operators. We conclude by studying the extent to which fixed-point logic with counting can express problems in linear algebra over finite commutative rings, generalising known results on the logical definability of linear-algebraic problems over finite fields.
Full work available at URL: https://arxiv.org/abs/1204.3022
Recommendations
- Definability of linear equation systems over groups and rings
- Descriptive complexity of linear equation systems and applications to propositional proof complexity
- On the Descriptive Complexity of Linear Algebra
- Affine systems of equations and counting infinitary logic
- Affine Systems of Equations and Counting Infinitary Logic
Linear equations (linear algebraic aspects) (15A06) Model theory of finite structures (03C13) Decidability of theories and sets of sentences (03B25) Descriptive complexity and finite models (68Q19)
Cited In (5)
- Descriptive complexity of linear equation systems and applications to propositional proof complexity
- Efficient information-theoretic multi-party computation over non-commutative rings
- Affine Systems of Equations and Counting Infinitary Logic
- On the Descriptive Complexity of Linear Algebra
- Definability of linear equation systems over groups and rings
This page was built for publication: Definability of linear equation systems over groups and rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649548)
