Author:
Demri Stéphane,Rabinovich Alexander
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. M. Bezem, T. Langholm, and M. Walicki. Completeness and decidability in sequence logic. InLPAR'07, volume 4790 ofLecture Notes in Computer Science, pages 123-137. Springer, 2007.
2. J.R. Büchi and D. Siefkes.The monadic second order theory of all countable ordinals, volume 328 ofLecture Notes in Mathematics. Springer, 1973.
3. R. Büchi. On a decision method in restricted second-order arithmetic. InInternational Congress on Logic, Method and Philosophical Science'60, pages 1-11, 1962.
4. J.R Büchi. Transfinite automata recursions and weak second order theory of ordinals. InInt. Cong. Logic, Methodology and Philosophy of Science, Jerusalem, pages 3-23, 1964.
5. Decision methods in the theory of ordinals
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献