Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1977: Fundamentals of Computation Theory pp 511–515Cite as

Decidability of ω — Trees with bounded sets — A survey

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. EHRENFEUCHT, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961), 129–141.

    Google Scholar 

  2. R.J. FRAISSÉ, Sur quelques classifications des relations, basées sur des isomorphismes restreints. I. Etude générale. II. Application aux relations d' order, Alger — Mathematiques, vol. 2 (1955), 16–60, 273–295.

    Google Scholar 

  3. H. LÄUCHLI, A decision procedure for the weak second order theory of linear order, Contributions to Math. Logic. Proc. of the Logic Colloquium, Hanover 1966, North-Holland Publ. Co., Amsterdam 1968.

    Google Scholar 

  4. J.A. MAKOWSKY, Topological Model Theory, Proceedings of the CIME model theory session, Bressanone 1975.

    Google Scholar 

  5. M.O. RABIN, A Simple Method of Undecidability Proofs and some Applications, Log. Meth. Phil. Science Proc. Jerusalem, (1964), 58–68.

    Google Scholar 

  6. M.O. RABIN, Decidability of second order theories and automata on infinite trees, Trans. A.M.S. 149 (1969), 1–35.

    Google Scholar 

  7. M.O. RABIN, Automata on Infinite Objects and Church's Problem, Conference Board of the Mathematical Sciences, Regional Conference Series in Mathematics, No. 13.

    Google Scholar 

  8. D.G. SEESE and H.P. TUSCHIK, Constructions of Nice Trees, appears in Proc. of the 3. Conference on Set Theory and Hierarchy Theory, Bierutowice 1976.

    Google Scholar 

  9. D.G. SEESE, Second Order Logic, Generalized Quantifiers and Decidability, to appear in Bulletin de L' Academie Polonaise des Sciences.

    Google Scholar 

  10. S. SHELAH, The monadic theory of order, Annals of Mathematics, 102 (1975), 379–419.

    Google Scholar 

  11. J.J. LE TOURNEAU, Decision problems related to the concept of operation, Ph.D. Thesis, Berkeley 1968.

    Google Scholar 

  12. S. VINNER, A generalization of Ehrenfeucht's Game and some Applications, Israel Journal of Mathematics, Vol. 12, No. 3, (1972), 279–298.

    Google Scholar 

  13. M. ZIEGLER, letter 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AdW der DDR, ZIMM, Mohrenstr. 39, 108, Berlin, DDR

    Detlef Seese

Authors
  1. Detlef Seese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seese, D. (1977). Decidability of ω — Trees with bounded sets — A survey. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_122

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_122

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation