ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • infinitary predicate KD4  (2)
  • Springer  (2)
  • 2005-2009
  • 1995-1999  (2)
  • 1960-1964
Collection
Publisher
  • Springer  (2)
Years
  • 2005-2009
  • 1995-1999  (2)
  • 1960-1964
Year
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 57 (1996), S. 325-354 
    ISSN: 1572-8730
    Keywords: infinitary predicate KD4 ; common knowledge ; Nash equilibrium ; undecidability on playability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper provides a logic framework for investigations of game theoretical problems. We adopt an infinitary extension of classical predicate logic as the base logic of the framework. The reason for an infinitary extension is to express the common knowledge concept explicitly. Depending upon the choice of axioms on the knowledge operators, there is a hierarchy of logics. The limit case is an infinitary predicate extension of modal propositional logic KD4, and is of special interest in applications. In Part I, we develop the basic framework, and show some applications: an epistemic axiomatization of Nash equilibrium and formal undecidability on the playability of a game. To show the formal undecidability, we use a term existence theorem, which will be proved in Part II.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 58 (1997), S. 273-303 
    ISSN: 1572-8730
    Keywords: infinitary predicate KD4 ; common knowledge ; Nash equilibrium ; undecidability on playability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract This paper provides a Genzten style formulation of the game logic framework GLm (0 ≤ m ≤ ω), and proves the cut-elimination theorem for GLm. As its application, we prove the term existence theorem for GLω used in Part I.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...