The complexity of logical theories-Reference-Cited by-同舟云学术

The complexity of logical theories

Published:1980-05 Issue:1 Volume:11 Page:71-77
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Berman Leonard

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference9 articles.

1. Precise bounds for Presburger Arithmetic and the reals with addition: Preliminary report;Berman;Proc. 18th Annual IEEE Foundations of Computer Science Conference,1977

2. L. Berman, Complexity of QBF, to appear.

3. On time-space classes and their relation to the theory of real addition;Bruss;Theoret. Comput. Sci.,1980

4. A. Chandra, D. Kozen and L. Stockmeyer, Alternation, J. ACM, to appear.

5. A decision procedure for the first order theory of real addition with order;Ferrante;SIAM J. Comput.,1975

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

1. Regularity Conditions for Iterated Shuffle on Commutative Regular Languages;International Journal of Foundations of Computer Science;2023-09-02

2. On Presburger arithmetic extended with non-unary counting quantifiers;Logical Methods in Computer Science;2023-07-12

3. Geometric decision procedures and the VC dimension of linear arithmetic theories;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

4. Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?;Logical Methods in Computer Science;2022-07-28

5. Alternating complexity of counting first-order logic for the subword order;Acta Informatica;2022-06-26