Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Bulletin of the American Mathematical Society, vol. 74 , pp. 1025–1029. - Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, vol. 141 , pp. 1–35 [Book Review]

Journal of Symbolic Logic 37 (3):618-619 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Real Time Computation.Jiří Bečvář - 1966 - Journal of Symbolic Logic 31 (4):657.

Analytics

Added to PP
2013-11-03

Downloads
58 (#371,271)

6 months
9 (#497,927)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
A system of dynamic modal logic.Maarten de Rijke - 1998 - Journal of Philosophical Logic 27 (2):109-142.
Model theory for tense logics.Dov M. Gabbay - 1975 - Annals of Mathematical Logic 8 (1):185.
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.

View all 27 citations / Add more citations

References found in this work

No references found.

Add more references