Decidability of second-order theories and automata on infinite trees.
Open Access
- 1 January 1969
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 141, 1-35
- https://doi.org/10.1090/s0002-9947-1969-0246760-1
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 9 references indexed in Scilit:
- A Decision Procedure for the Weak Second Order Theory of Linear OrderPublished by Elsevier ,1968
- Mathematical theory of automataProceedings of Symposia in Applied Mathematics, 1967
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Symposium on Decision Problems: On a Decision Method in Restricted Second Order ArithmeticPublished by Elsevier ,1966
- Decision methods in the theory of ordinalsBulletin of the American Mathematical Society, 1965
- Infinite sequences and finite machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The strict determinateness of certain infinite gamePacific Journal of Mathematics, 1955
- Undecidability of Some Topological TheoriesFundamenta Mathematicae, 1951