Definability of linear equation systems over groups and rings

Details Definability of linear equation systems over groups and rings Definability of linear equation systems over groups and rings

2012-04-13

arxiv.org/abs/1204.3022v1

Computer Science

Logic in Computer Science

Scientific paper

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 solvable 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 known solvability problems that separate FPC from PTIME can be reduced to solvability over commutative rings. Further, we prove closure properties for classes of queries that reduce to solvability over rings. As an application, these closure properties provide normal forms for logics extended with solvability operators.

Affiliated with

Also associated with

No associations

Rating

Definability of linear equation systems over groups and rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Definability of linear equation systems over groups and rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Definability of linear equation systems over groups and rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-144373