On Second-Order Monadic Monoidal and Groupoidal Quantifiers
DOI10.2168/LMCS-6(3:25)2010zbMath1214.03025arXiv1009.2893MaRDI QIDQ2786142
Heribert Vollmer, Juha Kontinen
Publication date: 21 September 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.2893
computational complexityword problemleaf languagedescriptive complexitysecond-order generalized quantifier
Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Word problems, etc. in computability and recursion theory (03D40) Descriptive complexity and finite models (68Q19)
Related Items (1)
This page was built for publication: On Second-Order Monadic Monoidal and Groupoidal Quantifiers
