Nechiporuk E. I.. On the synthesis of logical nets in incomplete and degenerate basis. English translation of XXXVI 570. Soviet physics, Doklady, vol 9 no. 3 , pp. 207–208 [Book Review]

Journal of Symbolic Logic 36 (3):548-548 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270029

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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: E. I. Nechiporuk, On the Synthesis of Logical Nets in Incomplete and Degenerate Basis. [REVIEW]Louis Hodes - 1971 - Journal of Symbolic Logic 36 (3):548-548.
On the Synthesis of Logical Nets in Incomplete and Degenerate Basis.E. I. Nechiporuk - 1971 - Journal of Symbolic Logic 36 (3):548-548.
Lupanov O. B.. Implementing the algebra of logic functions in terms of bounded depth formulas in the basis of &, ν, ¯. English translation of XXXVI 572. Soviet physics, Doklady, vol. 6 no. 2 , pp. 107–108. [REVIEW]Louis Hodes - 1971 - Journal of Symbolic Logic 36 (3):547.
Belyakin N. V.. A certain class of Türing machines. English translation of XXXVII 211. Soviet physics, Doklady, vol. 8 no. 1 , pp. 3–4. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (1):198-198.
Ostianu V. M.. O sintézé kontaktnyh shém s šagovymi péréklúčatélámi. Doklady Akadémii Nauk SSSR, vol. 103 , pp. 827–830.Ostianu V. M.. On the synthesis of switching circuits with selector switches. English translation of the preceding. Multilith-offset. Morris D. Friedman, Inc., Needham Heights, Mass., c. 1957, 7 pp. [REVIEW]Edward F. Moore - 1959 - Journal of Symbolic Logic 24 (1):76-76.
Trahténbrot B. A.. Asimptotičéskaá océnka složnosti logičéskih sétéj s památ′ú. Doklady Akadémii Nauk SSSR, vol. 127 , pp. 281–284.Trahtenbrot B. A.. Asymptotic evaluation of the complexity of logic nets with memory. English translation of the above. Automation express,, vol. 2 , pp. 13–14. [REVIEW]Andrzej Blikle - 1964 - Journal of Symbolic Logic 29 (2):100-100.
Kabakov F. A.. O modélirovanii po réalizuémosti psévdobulévyh algébr. Doklady Akadémii Nauk SSSR, vol. 192 , pp. 16–18.Kabakov F. A.. On modelling of pseudo-Boolean algebras by realizability. English translation of the preceding by M. Machover. Soviet mathematics, vol. 11 no. 3 , pp. 562–564. [REVIEW]Gene F. Rose - 1972 - Journal of Symbolic Logic 37 (3):627-628.
Ánkov V. A.. O rasširénii intuicionistskogo propozicional′nogo isčisléniá do klassičéskogo i minimal′nogo-do intuicionistskogo. Izvéstiá Akadémii Nauk SSSR, Séria matématičéskaá, vol. 32 , pp. 208–211.Jankov V. A.. On the extension of the intuitionist propositional calculus to the classical calculus, and the minimal calculus to the intuitionist calculus. English translation of the preceding. Mathematics of the USSR—Izvestija , vol. 2 no. 1 , pp. 205–208. [REVIEW]J. G. Anderson - 1973 - Journal of Symbolic Logic 38 (2):331-331.
Minc G. É.. Skolèmovskij métod eliminacii položitél'nyh kvantorov v sékvéncial'nyh isčisléniáh. Doklady Akadémii Nauk SSSR, vol. 169 , pp. 24–27.Minc G. E.. Skolem's method of elimination of positive quantifiers in sequential calculi. English translation of the preceding by Ebner L.. Soviet mathematics, vol. 7 no. 4 , pp. 861–864. [REVIEW]J. van Heijenoort - 1971 - Journal of Symbolic Logic 36 (3):526-527.
Maslov S. Ú.. Préobrazovanié proizvol′nyh kanoničéskih isčislénij v kanoničéskié isčisléniá spécial′nyh tipov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 779–782.Maslov S. Ju.. Transformation of arbitrary canonical calculi into canonical calculi of special types. English translation of the preceding by Gdss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1708–1711. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):527-527.
Grindlingér É. I.. O nérazréšimosti problémy toždéstva slov dlá odnogo klassa polugrupp s razréšimoj problèmoj izomorfizma. Doklady Akadémii Nauk SSSR, vol. 171 , pp. 519–520.Grindlinger [Greendlinger] E. I.. On the unsolvability of the word problem for a class of semigroups with a solvable isomorphism problem. English translation of the preceding by Greendlinger M.. Soviet mathematics, vol. 7 no. 6 , pp. 1502–1503. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
S. N. Artemov. Arithmetically complete modal theories. Six papers in logic, American Mathematical Society translations, ser. 2 vol. 135, American Mathematical Society, Providence1987, pp. 39–54. , vol. 14 , pp. 115–133.) - S. N. Artemov. On modal logics axiomatizing provability. Mathematics of the USSR—Izvestiya, vol. 27 no. 3 , pp. 401–429. , pp. 1123–1154.) - S. N. Artemov. Nonarithmeticity of truth predicate logics of provability. Soviet mathematics—Doklady, vol. 32 , pp. 403–405. , pp. 270–271.) - V. A. Vardanyan. Arithmetic complexity of predicate logics of provability and their fragments. Soviet mathematics—Doklady, vol. 33 no. 3 , pp. 569–572. , pp. 11–14.) - S. N. Artemov. Numerically correct provability logics. Soviet mathematics—Doklady, vol. 34 , pp. 384–387. , pp. 1289–1292.). [REVIEW]Vann McGee - 1991 - Journal of Symbolic Logic 56 (1):329-332.
Proof nets and the complexity of processing center embedded constructions.Mark Johnson - 1998 - Journal of Logic, Language and Information 7 (4):433-447.
Ibn Sina's Remarks and Admonitions : Physics and Metaphysics : An Analysis and Annotated Translation.Shams C. Inati (ed.) - 2014 - New York: Columbia University Press.
A. D. Tajmanov. Haraktéristika aksiomatiziruémyh klassov modélej. II. Izvéstiá Akadémii Nauk SSSR, Séria matématičéskaá, vol. 25 , pp. 755–764. [REVIEW]Andrzej Mostowski - 1973 - Journal of Symbolic Logic 38 (1):165-166.

Analytics

Added to PP
2016-06-30

Downloads
4 (#1,625,946)

6 months
1 (#1,474,534)

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