On Second-Order Monadic Monoidal and Groupoidal Quantifiers
Logic in Computer Science
2015-07-01 v2
Abstract
We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be logically characterized in terms of second-order monadic monoidal quantifiers.
Cite
@article{arxiv.1009.2893,
title = {On Second-Order Monadic Monoidal and Groupoidal Quantifiers},
author = {Juha Kontinen and Heribert Vollmer},
journal= {arXiv preprint arXiv:1009.2893},
year = {2015}
}