Weakly Definable Relations and Special Automata

Journal of Symbolic Logic 40 (4):622-623 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271833

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

My notes

Similar books and articles

Review: Michael O. Rabin, Weakly Definable Relations and Special Automata. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):622-623.
Rabin Michael O.. Weakly definable relations and special automata. Mathematical logic and foundations of set theory, Proceedings of an international colloquium held under the auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968, edited by Bar-Hillel Yehoshua, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 1–23. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):622-623.
Review: Michael O. Rabin, Automata on Infinite Objects and Church's Problem. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
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. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
Rabin Michael O.. Automata on infinite objects and Church's problem. Conference Board of the Mathematical Sciences, Regional conference series in mathematics, no. 13. American Mathematical Society, Providence 1972, 22 pp. [REVIEW]Dirk Siefkes - 1975 - Journal of Symbolic Logic 40 (4):623-623.
Review: Michael O. Rabin, Effective Computability of Winning Strategies. [REVIEW]Patrick Suppes - 1958 - Journal of Symbolic Logic 23 (2):224-224.
Review: Michael O. Rabin, Classes of Models and Sets of Sentences with the Intersection Property. [REVIEW]Abraham Robinson - 1967 - Journal of Symbolic Logic 32 (3):413-413.

Analytics

Added to PP
2015-02-05

Downloads
16 (#1,196,523)

6 months
4 (#1,258,347)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Branching-time logics repeatedly referring to states.Volker Weber - 2009 - Journal of Logic, Language and Information 18 (4):593-624.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.

Add more citations

References found in this work

No references found.

Add more references