Skip to main content
SpringerLink
Log in

Using determinancy of games to eliminate quantifiers

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

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.

Bibliography

  • R. Rado, Axiomatic treatment of rank in infinite sets, Canadian J. of Math. 1 (1949), 337–343.

    Google Scholar 

  • F.P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (1929), 264–286.

    Google Scholar 

  • J.R. Büchi, The monadic second order theory of θ1, Lecture Notes in Math. 328, Springer (1973), 1–127.

    Google Scholar 

  • J.R. Büchi, On a decision method in restricted second order arithmetic, Proc. 1960 Int. Cong. for Logic, Stanford Univ. Press (1962), 1–11.

    Google Scholar 

  • L. Löwenheim, Ãœber Möglichkeiten im Relativekalkul, Math. Ann. 76 (1915), 447–470.

    Google Scholar 

  • F. Hausdorff, Mengenlehre, 3. Auflage, Dover N.Y. 1944.

    Google Scholar 

  • R. McNaughton, Testing and generating infinite sequences by finite automata, Inform. and Control 9. (1966), 521–530.

    Google Scholar 

  • Büchi and Landweber, Solving sequential conditions by finite state operators, Trans. Am. Math. Soc. 138 (1969) 295–311.

    Google Scholar 

  • D.A. Martin, Measurable cardinals and analytic games, Fu. Math 66 (1970), 287–291.

    Google Scholar 

  • M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Am. Math. Soc. 141 (1969) 1–35.

    Google Scholar 

  • M. Davis, Infinite games of perfect information, Advances in game theory, Ann. of Math. Study 52 (1964), 85–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Purdue University, USA

    J. Richard Buchi

Authors
  1. J. Richard Buchi
    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

Buchi, J.R. (1977). Using determinancy of games to eliminate quantifiers. 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_104

Download citation

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

  • 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