Review: M. A. Aizerman, L. A. Gusev, L. I. Rozonoer, I. M. Smirnova, A. A. Tal, The algorithmic Insolubility of the Problem of Recognizing the Representability of recursive events in finite automata [Book Review]

Journal of Symbolic Logic 37 (2):410-411 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

The algorithmic Insolubility of the Problem of Recognizing the Representability of recursive events in finite automata.M. A. Aizerman, L. A. Gusev, I. M. Smirnova & A. A. Tal - 1972 - Journal of Symbolic Logic 37 (2):410-411.
Review: M. A. Ajzerman, L. A. Gusev, L. I. Rozonoer, I. M. Smirnova, A. A. Tal, Logic, Automata, Algorithms. [REVIEW]Jiri Becvar - 1966 - Journal of Symbolic Logic 31 (1):109-111.
Review: Marc A. Aiserman, Leonid A. Gusev, Lev I. Rozonoer, Irina M. Smirnova, Aleksey A. Tal, George M. Kranc, Logic, Automata, and Algorithms. [REVIEW]Ann S. Ferebee - 1972 - Journal of Symbolic Logic 37 (3):625-625.
Shih-Hua Hu. Recursive algorithms. Theory of recursive algorithms I. English translation of XXXVII 640. Scientia Sinica, vol. 9 , pp. 843–875. Reprinted in Chinese mathematics, vol. 1 , pp. 64–96.Shih-Hua Hu and Chung-Wan Loh. Kernel functions. Theory of recursive algorithms II. English translation of XXXVII 640. Scientia Sinica, vol. 9 , pp. 876–888. Reprinted ibid., pp. 97–109.Shih-Hua Hu. Normal forms of recursive functions. Theory of recursive algorithms III. English translation of XXXVII 640. Scientia Sinica, vol. 9 , pp. 889–896. Reprinted ibid., pp. 110–117. [REVIEW]V. Vuckovic - 1972 - Journal of Symbolic Logic 37 (3):612-612.
Zakrevskii A. D.. A visual-matrix method for minimizing Boolean functions. English translation of XXXVI 572. Automation and remote control, vol. 21 , pp. 255–258. [REVIEW]H. Enderton - 1971 - Journal of Symbolic Logic 36 (3):549-549.
Logic, Automata, Algorithms.L. I. Rozonoer & I. M. Smirnova - 1966 - Journal of Symbolic Logic 31 (1):109-111.
A. L. Čérnávskij. Modélirovanié procéssa réšéniá složnyh logičéskih zadač na vyčislitél′nyh mašinah . Russian with English summary. Avtomatika i téléméhanika, no. 1 , pp. 166–187. - A. L. Chernyavskii. Computer simulation of the process of solving complex logical problems . English translation of the preceding. Automation and remote control, no. 1 , pp. 145–167. [REVIEW]D. C. Cooper - 1968 - Journal of Symbolic Logic 33 (2):303-303.
Šéstakov V. I.. Pérfokartočnyj métod sintéza mnogotaktnyh réléjnyh sistém Avtomatika i téléméhanika, vol. 19 , pp. 592–605.Shestakov V. I.. A punched card method for synthesizing relay systems. English translation of the preceding. Automation and remote control, vol. 19 no. 6 , pp. 581–592. [REVIEW]Edward F. Moore - 1959 - Journal of Symbolic Logic 24 (3):259-259.
Možarov R. V.. Ob odnom priznaké polnoty sistémy funkcij algébry logiki . Avtomatika i téléméhanika, vol. 26, , pp. 1644–1645.Mozharov R. V.. One method for testing the completeness of systems of logical functions. English translation of the preceding. Automation and remote control, vol. 26 , pp. 1592–1593. [REVIEW]William Wernick - 1973 - Journal of Symbolic Logic 38 (2):343-343.
Undecidability of representability as binary relations.Robin Hirsch & Marcel Jackson - 2012 - Journal of Symbolic Logic 77 (4):1211-1244.
Jankov V. A.. Constructing a sequence of strongly independent superintuitionistic propositional calculi. English translation of XXXVII 206 by Yablonsky A.. Soviet mathematics, vol. 9 no. 4 , pp. 806–807.Jankov V. A.. The calculus of the weak “law of excluded middle.” English translation of XXXVII 206. Mathematics of the USSR—Izvestija , vol. 2 no. 5 , pp. 997–1004. [REVIEW]Alfred Horn - 1972 - Journal of Symbolic Logic 37 (1):186-186.
M. P. Schützenberger. On the definition of a family of automata. Information and control, vol. 4 (1961), pp. 245–270. - M. P. Schützenberger. Finite counting automata.Information and control, vol. 5 (1962), pp. 91–107. - M. P. Schützenberger. Certain elementary families of automata. Proceedings of the Symposium of Mathematical Theory of Automata, New York, N.Y., Microwave Research Symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, New York1963, pp. 139–153. [REVIEW]Michael O. Rabin - 1969 - Journal of Symbolic Logic 34 (2):296-297.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Arithmetic of divisibility in finite models.A. E. Wasilewska & M. Mostowski - 2004 - Mathematical Logic Quarterly 50 (2):169.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.

Analytics

Added to PP
2013-11-22

Downloads
32 (#488,786)

6 months
8 (#347,798)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references