Modal extensions of Lukasiewicz logic for modelling coalitional power

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F17%3A00471671" target="_blank" >RIV/67985556:_____/17:00471671 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1093/logcom/exv081" target="_blank" >http://dx.doi.org/10.1093/logcom/exv081</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1093/logcom/exv081" target="_blank" >10.1093/logcom/exv081</a>

Result language

angličtina

Original language name

Modal extensions of Lukasiewicz logic for modelling coalitional power

Original language description

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modelling the dynamics of a game frame whose states may correspond to different game forms. The two classes of effectivity functions studied are the families of playable and truly playable effectivity functions, respectively. In this article, we generalize the concept of effectivity function beyond the yes/no truth scale. This enables us to describe the situations in which the coalitions assess their effectivity in degrees, based on functions over the outcomes taking values in a finite Lukasiewicz chain. Then we introduce two modal extensions of Lukasiewicz finite-valued logic together with many-valued neighbourhood semantics in order to encode the properties of many-valued effectivity functions associated with game forms. As our main results we prove completeness theorems for the two newly introduced modal logics.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GAP402%2F12%2F1309" target="_blank" >GAP402/12/1309: A Multivalued Approach to Optima and Equilibria in Economics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Logic and Computation

ISSN

0955-792X

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

1

Country of publishing house

GB - UNITED KINGDOM

Number of pages

26

Pages from-to

129-154

UT code for WoS article

000397037900006

EID of the result in the Scopus database

2-s2.0-85014645540