Equilibrium Semantics for IF Logic and Many-Valued Connectives | SpringerLink
Skip to main content

Equilibrium Semantics for IF Logic and Many-Valued Connectives

  • Conference paper
  • First Online:
Logic, Language, and Computation (TbiLLC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10148))

Included in the following conference series:

  • 1295 Accesses

Abstract

We connect two different forms of game based semantics: Hintikka’s game for Independence Friendly logic (IF logic) and Giles’s game for Łukasiewicz logic. An interpretation of truth values in [0, 1] as equilibrium values in semantic games of imperfect information emerges for a logic that extends both, Łukasiewicz logic and IF logic. We prove that already on the propositional level all rational truth values can be obtained as equilibrium values.

C.G. Fermüller—Supported by Austrian Science Foundation (FWF) grant I1897-N25 (MoVaQ-MFL).

O. Majer—Supported by Czech Science Foundation grant GF15-34650L.

The original version of this chapter was revised. The affiliation and grant number of the second author have been corrected. The erratum to this chapter is available at DOI: 10.1007/978-3-662-54332-0_19

An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-3-662-54332-0_19

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /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
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    In fact there are certain complications if one admits formulas corresponding to games where a player may not have access to her own previous moves. We will circumvent these problems by insisting on perfect recall. Moreover, we follow [18, 21] in moving negations to the atomic level.

  2. 2.

    Hintikka uses Myself and Nature as names for the players and Verfier and Falisifer for the two roles.

  3. 3.

    It is more customary to attach the variable assignment to the interpretation instead of to the formula that is to evaluated. For the \(\mathcal H\)-game this does not make any difference. However we will later introduce games, where several formulas are to be evaluated over the same interpretation, but each with respect to a (possibly) different variable assignment.

  4. 4.

    \(\xi [c/x]\) denotes the variable assignment that is like \(\xi \), except for assigning c to x.

  5. 5.

    A t-norm is a commutative and associative function \(\circ :[0,1]^2 \rightarrow [0,1]\) such that \(x\circ 1= x\) and \(x<y\) implies \(x\circ z \le y\circ z\).

  6. 6.

    KZ is sometimes called the ‘weak fragment of Łukasiewicz logic’.

  7. 7.

    The powers of the players of a \(\mathcal G\)-game do not depend on the manner in which the current formula is picked at any state. In more formal presentations of the \(\mathcal G\)-game one may introduce the concepts of a regulation and of so-called internal states in formalizing state transitions. We refer to [5] for details.

  8. 8.

    The idea is that for each atomic formula A there is schematic experimental setup that turns into a concrete experiment if elements of the domain of discourse are assigned to the free variables in A.

  9. 9.

    Giles actually never considered strong conjunction and strong disjunction. For a detailed proof including strong conjunction we refer to [5]. That paper also features a link between the \(\mathcal G\)-game and an analytic proof system for Ł based on hypersequents.

  10. 10.

    As shown in [2] and in [4] one may in fact formulate alternative semantic games for Ł that, like the \(\mathcal H\)-game, keep a single formula in focus at any given state, if either an explicit truth value or a stack of formulas is added. These and related variants of semantic games are discussed in [3], but they hardly are relevant in our context.

  11. 11.

    This is somewhat reminiscent of [11], where an inner language for representing events and an outer, many-valued language for expressing assertions about the probability of such events is combined.

References

  1. Aguzzoli, S., Gerla, B., Marra, V.: Algebras of fuzzy sets in logics based on continuous triangular norms. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 875–886. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02906-6_75

    Chapter  Google Scholar 

  2. Cintula, P., Majer, O.: Towards evaluation games for fuzzy logics. In: Majer, O., Pietarinen, A.-V., Tulenheimo, T. (eds.) Games: Unifying Logic, Language, and Philosophy, pp. 117–138. Springer, Amsterdam (2009)

    Google Scholar 

  3. Fermüller, C.G.: Semantic games for fuzzy logics. In: Cintula, P., Fermüller, C.G., Noguerra, C. (eds.) Handbook of Mathematical Fuzzy Logic, vol. 3, pp. 969–1028 (2016)

    Google Scholar 

  4. Fermüller, C.G.: Semantic games with backtracking for fuzzy logics. In: 44th International Symposium on Multiple-Valued Logic (ISMVL), pp. 38–43. IEEE Press (2014)

    Google Scholar 

  5. Fermüller, C.G., Metcalfe, G.: Giles’s game and the proof theory of Łukasiewicz logic. Stud. Log. 92, 27–61 (2009)

    Article  MATH  Google Scholar 

  6. Galliani, P.: Game values and equilibria for undetermined sentences of dependence logic. Master thesis, Universiteit van Amsterdam (2008)

    Google Scholar 

  7. Giles, R.: A non-classical logic for physics. Stud. Log. 4(33), 399–417 (1974)

    MathSciNet  Google Scholar 

  8. Giles, R.: A non-classical logic for physics. In: Wojcicki, R., Malinkowski, G. (eds.) Selected Papers on Łukasiewicz Sentential Calculi, pp. 13–51. Polish Academy of Sciences (1977)

    Google Scholar 

  9. Giles, R.: Semantics for fuzzy reasoning. Int. J. Man Mach. Stud. 17(4), 401–415 (1982)

    Article  MATH  Google Scholar 

  10. Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)

    Book  MATH  Google Scholar 

  11. Hájek, P., Godo, L., Esteva, F.: Fuzzy logic and probability. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, pp. 237–244. Morgan Kaufmann Publisher (1995)

    Google Scholar 

  12. Hintikka, J.: Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic. Clarendon Press, Oxford (1973)

    MATH  Google Scholar 

  13. Hintikka, J., Sandu, G.: Game-theoretical semantics. In: Handbook of Logic and Language. Elsevier (2010)

    Google Scholar 

  14. Japaridze, G.: Introduction to computability logic. Ann. Pure Appl. Logic 123(1), 1–99 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kuhn, H.W.: Extensive games and the problem of information. Contrib. Theor. Games 2, 193–216 (1953)

    MathSciNet  MATH  Google Scholar 

  16. Lorenzen, P.: Logik und Agon. In: Atti Congr. Internaz. di Filosofia, Venezia, 12–18 Settembre 1958, vol, IV. Sansoni (1960)

    Google Scholar 

  17. Lorenzen, P.: Dialogspiele als semantische Grundlage von Logikkalkülen. Archiv für mathemathische Logik und Grundlagenforschung 11, 32–55, 73–100 (1968)

    Google Scholar 

  18. Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic: A Game-Theoretic Approach. Cambridge University Press, Cambridge (2011)

    Book  MATH  Google Scholar 

  19. Nguyêñ, H.T., Walker, E.A.: A First Course in Fuzzy Logic. CRC Press, Boca Raton (2006)

    MATH  Google Scholar 

  20. Scarpellini, B.: Die Nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz. J. Symbolic Logic 27(2), 159–170 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  21. Sevenster, M., Sandu, G.: Equilibrium semantics of languages of imperfect information. Ann. Pure Appl. Logic 161(5), 618–631 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sandu, G., Pietarinen, P.: A partiality and games: propositional logic. Logic J. IGPL 9(1), 101–121 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Pietarinen, A.V.: Propositional logic of imperfect information: foundations and applications. Notre Dame J. Formal Logic 42(4), 193–210 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Raghavan, T.E.S.: Zero-sum two person games. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications, vol. 2, pp. 736–759. Elsevier, Amsterdam (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christian G. Fermüller .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Fermüller, C.G., Majer, O. (2017). Equilibrium Semantics for IF Logic and Many-Valued Connectives. In: Hansen, H., Murray, S., Sadrzadeh, M., Zeevat, H. (eds) Logic, Language, and Computation. TbiLLC 2015. Lecture Notes in Computer Science(), vol 10148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54332-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-54332-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-54331-3

  • Online ISBN: 978-3-662-54332-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics