群和环上线性方程组的可定义性
Definability of linear equation systems over groups and rings
摘要:
出于对PTIME逻辑的追求和最近的见解,从线性代数问题的描述复杂性是这个问题的一个重要方面,我们研究了线性方程组的可解性有限群和环的逻辑(间)定义的观点。我们考虑的所有问题都是在多项式时间内可判定的,但不能用带计数的不动点逻辑来表示。他们还提供了一个自然的候选人分离的多项式时间从秩逻辑,扩展不动点逻辑的运营商确定的秩可定义的矩阵,这是足够的可解性问题领域。基于有限环的结构理论,我们建立了各种可解性问题的逻辑归约。我们的研究结果表明,所有的线性方程组的可解性问题,分离不动点逻辑计数PTIME可以减少到可解性交换环。此外,我们证明了封闭性质的查询类,减少到可解性环,这提供了范式的逻辑扩展与可解性运营商。我们的结论是研究在何种程度上的不动点逻辑计数可以表示问题的线性代数有限交换环,推广已知的结果在有限域的线性代数问题的逻辑定义。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。