On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates-Reference-Cited by-同舟云学术

On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates

Published:2024-07-08 Issue: Volume: Page:1-14
ISSN:
Container-title:Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Berthé Valérie¹^ORCID,Karimov Toghrul²^ORCID,Nieuwveld Joris²^ORCID,Ouaknine Joël²^ORCID,Vahanwala Mihir²^ORCID,Worrell James³^ORCID

Affiliation:

1. Université Paris Cité, IRIF, CNRS, Paris, France

2. Max Planck Institute for Software Systems, Saarbrücken, Germany

3. Department of Computer Science, University of Oxford, Oxford, United Kingdom

Funder

Deutsche Forschungsgemeinschaft

Agence Nationale de la Recherche

Engineering and Physical Sciences Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3661814.3662119

Reference37 articles.

1. Boris Adamczewski and Yann Bugeaud. 2007. On the complexity of algebraic numbers I. Expansions in integer bases. Annals of Mathematics (2007), 547--565.

2. Jean-Paul Allouche and Jeffrey Shallit. 2003. Automatic sequences: theory, applications, generalizations. Cambridge university press.

3. Complexity of sequences defined by billiard in the cube

4. Yu. Baryshnikov. 1995. Complexity of trajectories in rectangular billiards. Communications in mathematical physics 174 (1995), 43--56.

5. Decidability and undecidability of theories with a predicate for the primes

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

1. On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08