Skip to main content
Springer Nature Link
Log in

Infinite Games and Uniformization

  • Conference paper
Logic and Its Applications (ICLA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6521))

Included in the following conference series:

Abstract

The problem of solvability of infinite games is closely connected with the classical question of uniformization of relations by functions of a given class. We work out this connection and discuss recent results on infinite games that are motivated by the uniformization problem.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Büchi, J.R., Landweber, L.H.: Definability in the monadic second-order theory of successor. J. Symb. Logic 34, 166–170 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  2. Church, A.: Applications of recursive arithmetic to the problem of circuit synthesis. In: Summaries of the Summer Institute of Symbolic Logic, vol. I, pp. 3–50. Cornell Univ., Ithaca (1957)

    Google Scholar 

  3. Church, A.: Logic, arithmetic, and automata. In: Proc. Int. Congr. Math. (1962); Inst. Mittag-Leffler, Djursholm, Sweden, pp. 23–35 (1963)

    Google Scholar 

  4. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)

    MATH  Google Scholar 

  5. Fridman, W.: Formats of winning strategies for six types of pushdown games. In: Montanari, A., et al. (eds.) Proc. 1st Symp. on Games, Automata, Logic, and Formal Verification, GandALF 2010. Electr. Proc. in Theor. Comput. Sci., vol. 25 (2010)

    Google Scholar 

  6. Gale, D., Stewart, F.M.: Infinite games with perfect information. Ann. Math. Studies 28, 245–266 (1953)

    MathSciNet  MATH  Google Scholar 

  7. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  8. Holtmann, M., Kaiser, L., Thomas, W.: Degrees of Lookahead in Regular Infinite Games. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 252–266. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Rabinovich, A., Thomas, W.: Decidable theories of the ordering of natural numbers with unary predicates. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 562–574. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Sakarovitch, J.: Elements of Automata Theory. Cambridge Univ. Press, Cambridge (2009)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Informatik 7, RWTH Aachen University, 52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology, 208016, Kanpur, India

    Mohua Banerjee

  2. Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, 208016, Kanpur, India

    Anil Seth

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2011). Infinite Games and Uniformization. In: Banerjee, M., Seth, A. (eds) Logic and Its Applications. ICLA 2011. Lecture Notes in Computer Science(), vol 6521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18026-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18026-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-18025-5

  • Online ISBN: 978-3-642-18026-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics