{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:06:01Z","timestamp":1725501961030},"publisher-location":"Berlin, Heidelberg","reference-count":78,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781264"},{"type":"electronic","value":"9783540781271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78127-1_1","type":"book-chapter","created":{"date-parts":[[2008,2,7]],"date-time":"2008-02-07T12:59:40Z","timestamp":1202389180000},"page":"1-38","source":"Crossref","is-referenced-by-count":2,"title":["From Logic to Theoretical Computer Science \u2013 An Update"],"prefix":"10.1007","author":[{"given":"Boris A.","family":"Trakhtenbrot","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Agafonov, V.N.: Complexity of algorithms and computations (part 2). Lecture Notes, p. 146. Novosibirsk State University (1975)"},{"key":"1_CR2","first-page":"245","volume":"15","author":"J..M. Barzdin","year":"1965","unstructured":"Barzdin, J.M.: Complexity of the recognition of the symmetry predicate in Turing machines. Problemy Kibernetiki\u00a015, 245\u2013248 (1965)","journal-title":"Problemy Kibernetiki"},{"key":"1_CR3","first-page":"699","volume":"189","author":"M. Barzdin Ja","year":"1969","unstructured":"Ja Barzdin, M.: On computability on probabilistic machines. DAN SSSR\u00a0189, 699\u2013702 (1969)","journal-title":"DAN SSSR"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01276436","volume":"2","author":"R. Beigel","year":"1992","unstructured":"Beigel, R., Feigenbaum, J.: On being incoherent without being very hard. Computational Complexity\u00a02, 1\u201317 (1992)","journal-title":"Computational Complexity"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"1_CR6","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of the 1960 Intl. Cong. on Logic, Philosophy and Methodology of Sciences, pp. 1\u201311. Stanford Univ. Press (1962)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Burks, A., Wright, J.: Theory of logical nets. Proc. IRE\u00a041(4) (1953)","DOI":"10.1109\/JRPROC.1953.274312"},{"key":"1_CR8","first-page":"3","volume-title":"Summaries of the Summer Institute of Symbolic Logic","author":"A. Church","year":"1957","unstructured":"Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol.\u00a01, pp. 3\u201350. Cornell Univ., Ithaca, NY (1957)"},{"key":"1_CR9","unstructured":"Church, A.: Application of recursive arithmetic to the theory of computers and automata, notes, summer conference course. In: Advanced Theory of the Logical Design of Digital Computers, pp. 1\u201368. University of Michigan (1959)"},{"key":"1_CR10","unstructured":"Church, A.: Logic, arithmetic and automata. In: Proceedings of Intl. Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"1_CR11","unstructured":"Dekhtyar, M.I.: The impossibility of eliminating complete search in computing functions from their graphs. In: DAN SSSR 189, pp. 748\u2013751 (1969)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Freivald, R.V.: Fast probabilistic algorithms. LNCS, vol.\u00a074, pp. 57\u201369 (1979)","DOI":"10.1007\/3-540-09526-8_5"},{"key":"1_CR13","unstructured":"Glushkov, V.M.: Synthesis of digital automata, Fizmatgiz, Moscow (1962)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Halpern, J., Meyer, A., Trakhtenbrot, B.A.: The semantics of local storage, or what makes the free list free (preliminary report). In: Conference Record of the XI ACM Symposium on Principles of Programming Languages (POPL), pp. 245\u2013257 (1984)","DOI":"10.1145\/800017.800536"},{"issue":"1","key":"1_CR15","first-page":"1","volume":"62","author":"Y. Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich., A.: Logics for real time: decidability and complexity. Fundamenta Informatica\u00a062(1), 1\u201328 (2004)","journal-title":"Fundamenta Informatica"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Hirshfeld, Y., Rabinovich, A., Trakhtenbrot, B.A.: Discerning causality in interleaving behavior. In: Proceedings of Logic at Botic 1989, Pereslavl Zalessky, USSR (July 1989)","DOI":"10.1007\/3-540-51237-3_13"},{"key":"1_CR17","unstructured":"Kobrinski, N.E., Trakhtenbrot, B.A.: Introduction to the Theory of Finite Automata, Fizmatgis, Moscow, pp. 1\u2013404 (1962), English translation. In: Studies in Logic and the Foundations of Mathematics, North-Holland(1965)"},{"key":"1_CR18","first-page":"896","volume":"6","author":"A.V. Kuznetsov","year":"1955","unstructured":"Kuznetsov, A.V., Trakhtenbrot, B.A.: Investigation of partial recursive operators by techniques of Baire spaces. Doklady AN SSR 105\u00a06, 896\u2013900 (1955)","journal-title":"Doklady AN SSR 105"},{"key":"1_CR19","first-page":"31","volume":"14","author":"O.B. Lupanov","year":"1965","unstructured":"Lupanov, O.B.: An approach to systems synthesis \u2013 a local coding principle. Problems of Cybernetics\u00a014, 31\u2013110 (1965)","journal-title":"Problems of Cybernetics"},{"key":"1_CR20","unstructured":"McCarthy, J., Shannon, C. (eds.): Automata Studies, Princeton (1956)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"McCreight, E.M., Meyer, A.R.: Classes of computable functions defined by bounds on computation. In: Proc. of 1st STOC, pp. 79\u201388 (1969)","DOI":"10.1145\/800169.805423"},{"key":"1_CR22","volume-title":"Project MAC Rep.","author":"R. McNaughton","year":"1965","unstructured":"McNaughton, R.: Finite-state infinite games. In: Project MAC Rep., September 1965, MIT, Cambridge (1965)"},{"key":"1_CR23","volume-title":"Proj. MAC","author":"A.R. Meyer","year":"1973","unstructured":"Meyer, A.R.: Weak monadic second order theory of successor is not elementary recursive. In: Proj. MAC, MIT, Cambridge (1973)"},{"key":"1_CR24","unstructured":"Meyer, A.R.: unpublished memo; see the second chapter of this collection"},{"issue":"1","key":"1_CR25","first-page":"123","volume":"62","author":"D. Pardo","year":"2004","unstructured":"Pardo, D., Rabinovich, A., Trakhtenbrot, B.A.: Synchronous circuits over continuous time: feedback reliability and completeness. Fundamenta Informatica\u00a062(1), 123\u2013137 (2004)","journal-title":"Fundamenta Informatica"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin, G.: LCF considered as a programming language. Theoretical Comp. Science\u00a05, 223\u2013257 (1977)","journal-title":"Theoretical Comp. Science"},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A. Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets of processes. Fundamenta Informaticae\u00a011, 357\u2013403 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/BFb0013036","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"A. Rabinovich","year":"1989","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Nets of processes and data-flow. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 574\u2013602. Springer, Heidelberg (1989)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Nets and data-flow interpreters. In: Proceedings of LICS (1989)","DOI":"10.1109\/LICS.1989.39171"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Communication among relations. In: Proceedings of the 17th Colloquium on Automata, Languages and Programming, Warwick, England (1990)","DOI":"10.1007\/BFb0032040"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BFb0036202","volume-title":"Fundamentals of Computation Theory","author":"A. Rabinovich","year":"1997","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: From finite automata toward hybrid systems. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol.\u00a01279, pp. 411\u2013422. Springer, Heidelberg (1997)"},{"key":"1_CR32","unstructured":"Reynolds, J.C.: Idealized Algol and its specification logic, Technical Report, Syracuse University pp. 1-81 (1981)"},{"key":"1_CR33","unstructured":"Reynolds, J.C.: The essence of Algol. In: de Bakker, van Vliet (eds.) International Symposium on on Algorithmic Languages, North-Holland, pp. 345\u2013372 (1981)"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"1_CR34","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. pp. I\u2013III, Springer, Berlin (1997)"},{"key":"1_CR35","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01876321","volume":"15","author":"V.Y. Sazonov","year":"1976","unstructured":"Sazonov, V.Yu., Expressibility of functions in Scott\u2019s LCF language, Algebra i Logika 15, 308\u2013320 (in Russian); 192\u2013206 in English edition, 1976.","journal-title":"Algebra i Logika"},{"issue":"3","key":"1_CR36","first-page":"648","volume":"17","author":"V.Y. Sazonov","year":"1976","unstructured":"Sazonov, V.Y.: Functionals computable in series and in parallel. Siberian Math. Journal\u00a017(3), 648\u2013672 (1976) (in Russion); 498\u2013516 in English edition","journal-title":"Siberian Math. Journal"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0304-3975(93)90095-B","volume":"121","author":"D.A. Scott","year":"1993","unstructured":"Scott, D.A.: Type-theoretical alternative to CUCH, OWHY, ISWIM. Theoretical Computer Science\u00a0121, 411\u2013440 (1993) Reprint of a manuscript, Oxford University (1969)","journal-title":"Theoretical Computer Science"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Scott, D.: Some definitional suggestions in automata theory.J. of Computer and Syst. Sci., 187\u2013212 (1967)","DOI":"10.1016\/S0022-0000(67)80014-X"},{"key":"1_CR39","unstructured":"Scott, D., Strachey, C.: Toward a mathematical semantics of computer languages. In: Proceedings of a Symposium on Computer and Automata, New York (1971)"},{"key":"1_CR40","unstructured":"Shtokalo, I.Z. (ed.): History of Mathematics, Kiev (in Russian, 1970)"},{"key":"1_CR41","unstructured":"Slissenko, A.: A logic framework for verification of timed algorithms. Fundamenta Informaticae\u00a062(1) (August 2004)"},{"issue":"4","key":"1_CR42","first-page":"569","volume":"70","author":"B.A. Trakhtenbrot","year":"1950","unstructured":"Trakhtenbrot, B.A.: The impossibility of an algorithm for the decidability problem on finite classes. Doklady AN SSR\u00a070(4), 569\u2013572 (1950)","journal-title":"Doklady AN SSR"},{"key":"1_CR43","unstructured":"Trakhtenbrot, B.A.: Decidability problems for finite classes and definitions of finite sets. Ph.D. Thesis, Math. Inst. of the Ukrainian Academy of Sciences, Kiev (1950)"},{"issue":"6","key":"1_CR44","first-page":"953","volume":"88","author":"B.A. Trakhtenbrot","year":"1953","unstructured":"Trakhtenbrot, B.A.: On recursive separability. Doklady AN SSR\u00a088(6), 953\u2013956 (1953)","journal-title":"Doklady AN SSR"},{"issue":"4","key":"1_CR45","first-page":"417","volume":"101","author":"B.A. Trakhtenbrot","year":"1955","unstructured":"Trakhtenbrot, B.A.: Tabular representation of recursive operators. Doklady AN SSR\u00a0101(4), 417\u2013420 (1955)","journal-title":"Doklady AN SSR"},{"issue":"6","key":"1_CR46","first-page":"973","volume":"103","author":"B.A. Trakhtenbrot","year":"1955","unstructured":"Trakhtenbrot, B.A.: The synthesis of non-repetitive schemas. Doklady AN SSR\u00a0103(6), 973\u2013976 (1955)","journal-title":"Doklady AN SSR"},{"key":"1_CR47","first-page":"75","volume":"4","author":"B.A. Trakhtenbrot","year":"1956","unstructured":"Trakhtenbrot, B.A.: Signalizing functions and tabular operators. Uchionnye Zapiski Penzenskogo Pedinstituta (Transactions of the Penza Pedagogoical Institute)\u00a04, 75\u201387 (1956)","journal-title":"Uchionnye Zapiski Penzenskogo Pedinstituta (Transactions of the Penza Pedagogoical Institute)"},{"key":"1_CR48","first-page":"569","volume":"20","author":"B.A. Trakhtenbrot","year":"1956","unstructured":"Trakhtenbrot, B.A.: On the definition of finite set and the deductive incompleteness of set theory. Izvestia AN SSR\u00a020, 569\u2013582 (1956)","journal-title":"Izvestia AN SSR"},{"issue":"6","key":"1_CR49","first-page":"1005","volume":"112","author":"B.A. Trakhtenbrot","year":"1957","unstructured":"Trakhtenbrot, B.A.: On operators, realizable by logical nets. Doklady AN SSR\u00a0112(6), 1005\u20131006 (1957)","journal-title":"Doklady AN SSR"},{"key":"1_CR50","unstructured":"Trakhtenbrot, B.A.: Algorithms and Computing Machines, Gostechizdat (1957) second edition by Fizmatgiz, 1960; English translation in the series: Topics in Mathematics, D.C. Heath and Company, Boston, pp. 1\u2013101 (1963)"},{"issue":"4","key":"1_CR51","first-page":"646","volume":"118","author":"B.A. Trakhtenbrot","year":"1958","unstructured":"Trakhtenbrot, B.A.: The synthesis of logical nets whose operators are described in terms of monadic predicates. Doklady AN SSR\u00a0118(4), 646\u2013649 (1958)","journal-title":"Doklady AN SSR"},{"issue":"2","key":"1_CR52","first-page":"281","volume":"127","author":"B.A. Trakhtenbrot","year":"1959","unstructured":"Trakhtenbrot, B.A.: The asymptotic estimate of the logical nets with memory. Doklady AN SSR\u00a0127(2), 281\u2013284 (1959)","journal-title":"Doklady AN SSR"},{"issue":"2","key":"1_CR53","first-page":"320","volume":"138","author":"B.A. Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Some constructions in the monadic predicate calculus. Doklady AN SSR\u00a0138(2), 320\u2013321 (1961)","journal-title":"Doklady AN SSR"},{"issue":"2","key":"1_CR54","first-page":"326","volume":"140","author":"B.A. Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.A.: Finite automata and the monadic predicate calculus. Doklady AN SSR\u00a0140(2), 326\u2013329 (1961)","journal-title":"Doklady AN SSR"},{"issue":"1","key":"1_CR55","first-page":"103","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and the monadic predicate calculus. Siberian Math. Journal\u00a03(1), 103\u2013131 (1962)","journal-title":"Siberian Math. Journal"},{"issue":"1","key":"1_CR56","first-page":"25","volume":"1","author":"B.A. Trakhtenbrot","year":"1963","unstructured":"Trakhtenbrot, B.A.: On the frequency computation of recursive functions. Algebra i Logika, Novosibirsk\u00a01(1), 25\u201332 (1963)","journal-title":"Algebra i Logika, Novosibirsk"},{"key":"1_CR57","first-page":"99","volume":"12","author":"B.A. Trakhtenbrot","year":"1964","unstructured":"Trakhtenbrot, B.A.: On the complexity of schemas that realize many-parametric families of operators. Problemy Kibernetiki\u00a012, 99\u2013112 (1964)","journal-title":"Problemy Kibernetiki"},{"issue":"4","key":"1_CR58","first-page":"33","volume":"3","author":"B.A. Trakhtenbrot","year":"1964","unstructured":"Trakhtenbrot, B.A.: Turing Computations with Logarithmic Delay. Algebra i Logika, Novosibirsk\u00a03(4), 33\u201348 (1964)","journal-title":"Algebra i Logika, Novosibirsk"},{"issue":"5","key":"1_CR59","first-page":"79","volume":"4","author":"B.A. Trakhtenbrot","year":"1965","unstructured":"Trakhtenbrot, B.A.: Optimal computations and the frequency phenomena of Yablonski. Algebra i Logika, Novosibirsk\u00a04(5), 79\u201393 (1965)","journal-title":"Algebra i Logika, Novosibirsk"},{"issue":"6","key":"1_CR60","first-page":"61","volume":"5","author":"B.A. Trakhtenbrot","year":"1966","unstructured":"Trakhtenbrot, B.A.: On normalized signalizing functions for Turing computations. Algebra i Logika, Novosibirsk\u00a05(6), 61\u201370 (1966)","journal-title":"Algebra i Logika, Novosibirsk"},{"key":"1_CR61","unstructured":"Trakhtenbrot, B.A.: The Complexity of Algorithms and Computations, Lecture Notes, ed. by Novosibirsk University, pp. 1\u2013258 (1967)"},{"key":"1_CR62","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF02219824","volume":"8","author":"B.A. Trakhtenbrot","year":"1969","unstructured":"Trakhtenbrot, B.A.: On the complexity of the mutual-reduction algorithms in the construction of Novikov and Boone. Algebra i Logika\u00a08, 50\u201371 (1969)","journal-title":"Algebra i Logika"},{"key":"1_CR63","unstructured":"Trakhtenbrot, B.A., Barzdin, J.M.: Finite Automata (Behavior and Synthesis), Nauka, Moscow, pp. 1\u2013400 (1970) English translation in: Fundamental Studies in Computer Science 1, North-Holland (1973)"},{"issue":"6","key":"1_CR64","first-page":"1224","volume":"192","author":"B. Trakhtenbrot","year":"1970","unstructured":"Trakhtenbrot, B.: On autoreducibility. Doklady AN SSR\u00a0192(6), 1224\u20131227 (1970)","journal-title":"Doklady AN SSR"},{"key":"1_CR65","unstructured":"Trakhtenbrot, B.A.: Notes on the complexity of probabilistic machine computations. In: Theory of Algorithms and Mathematical Logic, ed. by the Computing Center of the Academy of Sciences, pp. 159\u2013176 (1974)"},{"key":"1_CR66","unstructured":"Trakhtenbrot, B.A.: On denotational semantics and axiomatization of partial correctness for languages with procedures as parameters and with aliasing (extended abstract), Technical Report, Tel Aviv University, p. 20 (August 1981)"},{"issue":"4","key":"1_CR67","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"B.A. Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to perebor (brute-force search) algorithms. Annals of the History of Computing\u00a06(4), 384\u2013400 (1984)","journal-title":"Annals of the History of Computing"},{"key":"1_CR68","unstructured":"Trakhtenbrot, B.A.: Selected Developments in Soviet Mathematical Cybernetics, Monograph Series, sponsored by Delphic Associates, Washington, XIV + 122 pages (1985)"},{"key":"1_CR69","first-page":"603","volume-title":"The Turing Universal Machine \u2013 A Half Century Survey","author":"B.A. Trakhtenbrot","year":"1988","unstructured":"Trakhtenbrot, B.A.: Comparing the Church and Turing approaches: two prophetical messages. In: The Turing Universal Machine \u2013 A Half Century Survey, pp. 603\u2013630. Oxford University Press, Oxford (1988)"},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Trakhtenbrot, B.A.: Origins and metamorphoses of the Trinity: logic, nets, automata. In: Proc. of the 10th IEEE Symposium on LICS, San Diego (1995)","DOI":"10.1109\/LICS.1995.523284"},{"issue":"1","key":"1_CR71","doi-asserted-by":"crossref","first-page":"83","DOI":"10.3233\/FI-1997-30106","volume":"30","author":"B.A. Trakhtenbrot","year":"1997","unstructured":"Trakhtenbrot, B.A.: On the power of compositional proofs. Fundamenta Informaticae\u00a030(1), 83\u201395 (1997)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"1_CR72","first-page":"160","volume":"7","author":"B.A. Trakhtenbrot","year":"1997","unstructured":"Trakhtenbrot, B.A.: In memory of S.A. Yanovskaya (1896\u20131966) on the centenary of her birth. Modern Logic\u00a07(2), 160\u2013187 (1997)","journal-title":"Modern Logic"},{"key":"1_CR73","unstructured":"Trakhtenbrot, B.A.(ed.): Special Issue on Continuous-Time Paradigms in Logic and Automata. Fundamenta Informaticae\u00a062(1) (August 2004)"},{"issue":"1","key":"1_CR74","first-page":"69","volume":"62","author":"B.A. Trakhtenbrot","year":"2004","unstructured":"Trakhtenbrot, B.A.: Understanding Basic Automata Theory in the Continuous Time Setting. Fundamenta Informaticae\u00a062(1), 69\u2013121 (2004)","journal-title":"Fundamenta Informaticae"},{"key":"1_CR75","unstructured":"Trakhtenbrot, B.A.: In memory of Andrei P. Ershov. In: Ershov, a Scientist and Human Being (in Russian), Publishing House of the Russian Academy of Sciences in Novosibirsk (2006)"},{"key":"1_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/3-540-12896-4_382","volume-title":"Logics of Programs","author":"B.A. Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A., Halpern, J., Meyer, A.R.: From denotational to operational and axiomatic semantics for Algol-like languages (an overview). In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 474\u2013500. Springer, Heidelberg (1984)"},{"key":"1_CR77","unstructured":"Yablonski, S.V.: Algorithmic difficulties in the synthesis of minimal contact networks (in Russian), Problems of Cybernetics, vol. 2, Moscow (1959)"},{"key":"1_CR78","unstructured":"Yanovskaya, S.: Mathematical logic and fundamentals of mathematics. In: Mathematics in the USSR for 40 Years, Moscow, Fizmatgiz, pp. 13\u2013120 (1959)"}],"container-title":["Lecture Notes in Computer Science","Pillars of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78127-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T00:11:27Z","timestamp":1630714287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78127-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781264","9783540781271"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78127-1_1","relation":{},"subject":[]}}