Work

On Second-Order Monadic Monoidal and Groupoidal Quantifiers

Year: 2010

Type: article

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.

Source: Logical Methods in Computer Science

DOI: 10.2168/lmcs-6(3:25)2010

Authors: Juha Kontinen, Heribert Vollmer

Institutions: University of Helsinki, Leibniz University Hannover

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Deutsche Forschungsgemeinschaft, Academy of Finland

Awards: G3141750733, G5593986267