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”

Exploring Jaśkowski’s Discussive Logic: Proof Analysis and Related Remarks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00641211" target="_blank" >RIV/67985807:_____/25:00641211 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/s10992-025-09808-4" target="_blank" >https://doi.org/10.1007/s10992-025-09808-4</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s10992-025-09808-4" target="_blank" >10.1007/s10992-025-09808-4</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Exploring Jaśkowski’s Discussive Logic: Proof Analysis and Related Remarks

  • Original language description

    This paper presents a comprehensive proof-theoretic analysis of Jaśkowski’s discussive (or discursive) logic, working with a set of connectives including classical negation and disjunction, as well as so-called (right-)discussive conjunction and discussive implication. By employing established techniques two labelled frameworks are introduced: sequent and natural deduction systems. The paper explores the ability of the proposed calculi to accurately represent Jaśkowski’s discussive logic, particularly in light of its paraconsistent nature, and establishes cut-admissibility and normalization theorems. Additionally, the introduced sequent calculus – shown to allow terminating proof search – is employed to prove the embedding of discussive logic within modal logic S5. Finally, it is proved that the natural deduction calculus translates into the corresponding sequent system, with soundness and completeness established for both calculi. Concluding remarks highlight the potential for expanding this study and suggest directions for future research.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • 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

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • 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

  • Name of the periodical

    Journal of Philosophical Logic

  • ISSN

    0022-3611

  • e-ISSN

    1573-0433

  • Volume of the periodical

    54

  • Issue of the periodical within the volume

    September 2025

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    59

  • Pages from-to

    935-993

  • UT code for WoS article

    001570387100001

  • EID of the result in the Scopus database

    2-s2.0-105016132480