Methods of class field theory to separate logics over finite residue classes and circuit complexity

DOI10.1093/LOGCOM/EXX007MaRDI QIDQ5894702zbMATH OpenOpenAlexFDO

Authors Carlos E. P. Ortiz, Argimiro Arratia

Publication date 13 February 2018

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.02175

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: Separations among the first order logic $calRing(0,+,\ast )$ of finite residue class rings, its extensions with generalized quantifiers, and in the presence of a built-in order are shown, using algebraic methods from class field theory. These methods include classification of spectra of sentences over finite residue classes as systems of congruences, and the study of their $h$-densities over the set of all prime numbers, for various functions $h$ on the natural numbers. Over ordered structures the logic of finite residue class rings and extensions are known to capture DLOGTIME-uniform circuit complexity classes ranging from $A{C}^0$ to $T{C}^0$. Separating these circuit complexity classes is directly related to classifying the $h$-density of spectra of sentences in the corresponding logics of finite residue classes. We further give general conditions under which a logic over the finite residue class rings has a sentence whose spectrum has no $h$-density. One application of this result is that in $calRing(0,+,\ast ,<)+M$, the logic of finite residue class rings with built-in order and extended with the majority quantifier $M$, there are sentences whose spectrum have no exponential density.

Recommendations

• First order extensions of residue classes and uniform circuit complexity
• Circuit complexity and the expressive power of generalized first-order formulas
• LATIN 2004: Theoretical Informatics
• Definability of Languages by Generalized First-Order Formulas over (N,+)
• Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$

Cited in

(1)

• First order extensions of residue classes and uniform circuit complexity

This page was built for publication: Methods of class field theory to separate logics over finite residue classes and circuit complexity

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