All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Two-Layered Logics for Paraconsistent Probabilities

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00580808" target="_blank" >RIV/67985807:_____/23:00580808 - isvavai.cz</a>

  • Alternative codes found

    RIV/67985955:_____/23:00580808

  • Result on the web

    <a href="https://doi.org/10.1007/978-3-031-39784-4_7" target="_blank" >https://doi.org/10.1007/978-3-031-39784-4_7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-39784-4_7" target="_blank" >10.1007/978-3-031-39784-4_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Two-Layered Logics for Paraconsistent Probabilities

  • Original language description

    We discuss two-layered logics formalising reasoning with paraconsistent probabilities that combine the Łukasiewicz [0,1]-valued logic with Baaz Delta operator and the Belnap–Dunn logic. The first logic formalises a ‘two-valued’ approach where each event ϕ has independent positive and negative measures that stand for, respectively, the likelihoods of ϕ and ¬ϕ. The second logic that we introduce here corresponds to ‘four-valued’ probabilities. There, ϕ is equipped with four measures standing for pure belief, pure disbelief, conflict and uncertainty of an agent in ϕ. We construct faithful embeddings of and into one another and axiomatise using a Hilbert-style calculus. We also establish the decidability of both logics and provide complexity evaluations for them using an expansion of the constraint tableaux calculus for L.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA22-01137S" target="_blank" >GA22-01137S: Metamathematics of substructural modal logics</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

  • Article name in the collection

    Logic, Language, Information, and Computation

  • ISBN

    978-3-031-39783-7

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    17

  • Pages from-to

    101-117

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Halifax

  • Event date

    Jul 11, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article