Skip to main content
SpringerLink
Log in

Implicit definability of finite binary trees by sets of equations

  • Section IV: Decision Problems
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 171))

Included in the following conference series:

  • 158 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Harel, D. First order Dynamic Logic. Lecture Notes in Computer Science 68, Springer Verlag, Berlin 1979.

    Google Scholar 

  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. 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. Urzyczyn, P. The Unwind Property in Certain Algebras. Information and Control, 50. No. 2., 1981, pp.91–109.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, 00-901, Warsaw, PKIN IX p, Poland

    Jerzy Tiuryn

Authors
  1. Jerzy Tiuryn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1984). Implicit definability of finite binary trees by sets of equations. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation