One quantifier alternation in first-order logic with modular predicates-Reference-Cited by-同舟云学术

One quantifier alternation in first-order logic with modular predicates

Published:2015-01 Issue:1 Volume:49 Page:1-22
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Kufleitner Manfred,Walter Tobias

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita/2014024/pdf

Reference33 articles.

1. Arfi M., Opérations polynomiales et hiérarchies de concaténation.Theor. Comput. Sci.91(1991) 71–84.

2. Barrington D.A.M., Compton K.J., Straubing H. and Thérien D., Regular languages in NC1.J. Comput. Syst. Sci.44(1992) 478–499.

3. Chaubard L., Pin J.-É. and Straubing H., Actions, wreath products of \hbox{$\mathcal{C}$}𝒞-varieties and concatenation product.Theor. Comput. Sci.356(2006) 73–89.

4. L. Chaubard, J.-É. Pin and H. Straubing, First order formulas with modular predicates. InProc. of LICS 2006.IEEE Computer Society (2006) 211–220.

5. L. Dartois and C. Paperman, Personal communication (2013).

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dot-depth three, return of the J-class;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. COVERING AND SEPARATION FOR LOGICAL FRAGMENTS WITH MODULAR PREDICATES;LOG METH COMPUT SCI;2019

3. Level Two of the Quantifier Alternation Hierarchy Over Infinite Words;Theory of Computing Systems;2017-08-04

4. Level Two of the Quantifier Alternation Hierarchy over Infinite Words;Computer Science – Theory and Applications;2016