Implicit definability of finite binary trees by sets of equations

  • Jerzy Tiuryn
Section IV: Decision Problems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 171)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Friedman, H. Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory. In Gandy and Yates (eds.) Logic Colloquium '69, North-Holland Publ. Co., Amsterdam 1977, pp.361–390.Google Scholar
  2. [2]
    Harel, D. First order Dynamic Logic. Lecture Notes in Computer Science 68, Springer Verlag, Berlin 1979.Google Scholar
  3. [3]
    Paterson, M.S. and Hewitt, C.E., Comparative Schematology. Record of Project MAC Conference on: Concurrent Systems and Parallel Computation, ACM, New York 1970, pp. 119–128.Google Scholar
  4. [4]
    Tiuryn, J. Unbounded ProgramMemory, Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract). Proc. of the 22nd Annual Symposium on Foundations of Computer Sience, Nashville, Tenn. 1981, pp. 33572-339.Google Scholar
  5. [5]
    Urzyczyn, P. The Unwind Property in Certain Algebras. Information and Control, 50. No. 2., 1981, pp.91–109.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Jerzy Tiuryn
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarsaw, PKIN IX pPoland

Personalised recommendations