On decidability of monadic logic of order over the naturals extended by monadic predicates-Reference-Cited by-同舟云学术

On decidability of monadic logic of order over the naturals extended by monadic predicates

Author:

Rabinovich Alexander

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference18 articles.

1. On a decision method in restricted second order arithmetic;Büchi,1960

2. Solving sequential conditions by finite-state strategies;Büchi;Transactions of the American Mathematical Society,1969

5. Y. Choueka. Finite Automata on Infinite Structure, Ph.D Thesis, Hebrew University, 1970.

Cited by 18 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

2. Deciding ω-regular properties on linear recurrence sequences;Proceedings of the ACM on Programming Languages;2021-01-04

3. Uniformisations of Regular Relations Over Bi-Infinite Words;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08