Modelling sources of inconsistent information in paraconsistent modal logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00505161" target="_blank" >RIV/67985807:_____/19:00505161 - isvavai.cz</a>
Alternative codes found
RIV/67985955:_____/19:00505161
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-31136-0_17" target="_blank" >http://dx.doi.org/10.1007/978-3-030-31136-0_17</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-31136-0_17" target="_blank" >10.1007/978-3-030-31136-0_17</a>
Alternative languages
Result language
angličtina
Original language name
Modelling sources of inconsistent information in paraconsistent modal logic
Original language description
Epistemic logics based on normal modal logic are notoriously bad at handling inconsistent and yet non-trivial information. This fact motivates epistemic logics based on paraconsistent logic, examples of which can be traced back at least to the 1980s. These logics handle inconsistent and non-trivial information, but they usually do not articulate sources of the inconsistency. Yet, making the origin of an inconsistency present in a body of information explicit is important to assess the body - can we trace the mutually conflicting pieces of information to sources of information relevant to the body or is the inconsistency a result of an error unrelated to any outside sources? Is the inconsistency derived from various equally trustworthy sources or from a single inconsistent source? In this article we show that a paraconsistent modal logic, namely, the logic BK introduced by Odintsov and Wansing, is a first step toward a formalism capable of making these distinctions explicit. We interpret the accessibility relation between states in a model as a source relation - states accessible from a given state are seen as sources of potential justification of the information contained in the original state. This interpretation also motivates the study of a number of extensions of BK. We focus here on extensions of BK able to articulate the relation of compatibility between bodies of information and extensions working with labels explicitly differentiating between bodies of information. In the case of compatibility-based extensions a more detailed technical study including a completeness proof is provided, technical features of the simpler case of label-based extensions, on the other hand, are discussed without going into details.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
New Essays on Belnap-Dunn Logic
ISBN
978-3-030-31135-3
Number of pages of the result
18
Pages from-to
293-310
Number of pages of the book
324
Publisher name
Springer
Place of publication
Cham
UT code for WoS chapter
—