Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regular languages defined with generalized quantifiers
Information and Computation
Counting modulo quantifiers on finite structures
Information and Computation - Special issue: LICS 1996—Part 1
Relational queries over interpreted structures
Journal of the ACM (JACM)
The descriptive complexity approach to LOGCFL
Journal of Computer and System Sciences
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Counting and Addition cannot Express Deterministic Transitive Closure
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Some Results on Majority Quantifiers over Words
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
Arithmetic, first-order logic, and counting quantifiers
ACM Transactions on Computational Logic (TOCL)
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Characterizing TC0 in Terms of Infinite Groups
Theory of Computing Systems
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
SIAM Journal on Computing
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Regular Languages Definable by Majority Quantifiers with Two Variables
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Inexpressibility results for regular languages in nonregular settings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition predicate are also definable with the order predicate as the only numerical predicate. Let S be a subset of monoids. Let L be the logic closed under quantification over the monoids in S. Then we prove that L[