Decidability of second-order theories and automata on infinite trees
Michael O. Rabin
Source: Bull. Amer. Math. Soc. Volume 74, Number 5
(1968), 1025-1029.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.bams/1183529958
Mathematical Reviews number (MathSciNet): MR0231716
Zentralblatt MATH identifier: 0313.02029
References
1. J. R. Büchi, On a decision method in restricted second-order arithmetic, Proc. Internat. Congress Logic, Method, and Philos. Sci. 1960, Stanford Univ. Press, Stanford, Calif., 1962, pp. 1-11.
Zentralblatt MATH: 0215.32401
Mathematical Reviews (MathSciNet): MR183636
2. J. R. Büchi, Decision methods in the theory of ordinals, Bull. Amer. Math. Soc. 71 (1965), 767-770.
Zentralblatt MATH: 0207.30904
Mathematical Reviews (MathSciNet): MR189997
Digital Object Identifier: doi:10.1090/S0002-9904-1965-11384-2
Project Euclid: euclid.bams/1183527305
3. A. Ehrenfeucht, Decidability of the theory of one function, Notices Amer. Math. Soc. 6 (1959), 268.
4. A. Ehrenfeucht, Decidability of the theory of one linear ordering relation, Notices Amer. Math. Soc. 6 (1959), 268-269.
5. Yu. L. Ershov, Decidability of the theory of relatively complemented distributive lattices and the theory of filters, Algebra i. Logika Sem. 3 (1964), 5-12.
6. A. Grzegorczyk, Undecidability of some topological theories, Fund. Math. 38 (1951), 137-152.
Zentralblatt MATH: 0045.00301
Mathematical Reviews (MathSciNet): MR47583
7. H. Laüchli, Decidability of the weak second-order theory of linear ordering, Kolloquium über Logik Grundlagen der Math., Hanover 1966 (to appear).
8. A. Tarski, Arithmetical classes and types of Boolean algebras, Bull. Amer. Math. Soc. 55 (1949), 64.
Bulletin of the American Mathematical Society
