Switch to: References

Add citations

You must login to add citations.
  1. Axiomatizing a Minimal Discussive Logic.Oleg Grigoriev, Marek Nasieniewski, Krystyna Mruczek-Nasieniewska, Yaroslav Petrukhin & Vasily Shangin - 2023 - Studia Logica 111 (5):855-895.
    In the paper we analyse the problem of axiomatizing the minimal variant of discussive logic denoted as $$ {\textsf {D}}_{\textsf {0}}$$ D 0. Our aim is to give its axiomatization that would correspond to a known axiomatization of the original discussive logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2. The considered system is minimal in a class of discussive logics. It is defined similarly, as Jaśkowski’s logic $$ {\textsf {D}}_{\textsf {2}}$$ D 2 but with the help of the deontic normal logic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Jaśkowski's Discussive Logics.Newton C. A. da Costa & Francisco A. Doria - 1995 - Studia Logica 54 (1):33 - 60.
    We expose the main ideas, concepts and results about Jaśkowski's discussive logic, and apply that logic to the concept of pragmatic truth and to the Dalla Chiara-di Francia view of the foundations of physics.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Paracomplete Versions of Jaśkowski's Discussive Logic.Krystyna Mruczek-Nasieniewska, Yaroslav Petrukhin & Vasily Shangin - 2024 - Bulletin of the Section of Logic 53 (1):29-61.
    Jaśkowski's discussive (discursive) logic D2 is historically one of the first paraconsistent logics, i.e., logics which 'tolerate' contradictions. Following Jaśkowski's idea to define his discussive logic by means of the modal logic S5 via special translation functions between discussive and modal languages, and supporting at the same time the tradition of paracomplete logics being the counterpart of paraconsistent ones, we present a paracomplete discussive logic D2p.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Remarks on discussive propositional calculus.Tomasz Furmanowski - 1975 - Studia Logica 34 (1):39 - 43.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Discussive sentential calculus of Jaśkowski.Jerzy Kotas - 1975 - Studia Logica 34 (2):149-168.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Paraconsistency in Non-Fregean Framework.Joanna Golińska-Pilarek - forthcoming - Studia Logica:1-39.
    A non-Fregean framework aims to provide a formal tool for reasoning about semantic denotations of sentences and their interactions. Extending a logic to its non-Fregean version involves introducing a new connective$$\equiv $$≡that allows to separate denotations of sentences from their logical values. Intuitively,$$\equiv $$≡combines two sentences$$\varphi $$φand$$\psi $$ψinto a true one whenever$$\varphi $$φand$$\psi $$ψhave the same semantic correlates, describe the same situations, or have the same content or meaning. The paper aims to compare non-Fregean paraconsistent Grzegorczyk’s logics (Logic of Descriptions$$\textsf{LD}$$LD, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Adjoint interpretations of sentential calculi.Tomasz Fukmanowski - 1982 - Studia Logica 41 (4):359 - 374.
    The aim of this paper is to give a general background and a uniform treatment of several notions of mutual interpretability. Sentential calculi are treated as preorders and logical invariants of adjoint situations, i.e. Galois connections are investigated. The class of all sentential calculi is treated as a quasiordered class.Some methods of the axiomatization of the M-counterparts of modal systems are based on particular adjoints. Also, invariants concerning adjoints for calculi with implication are pointed out. Finally, the notion of interpretability (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Axiomatizing Jaśkowski’s Discussive Logic $$\mathbf {D_2}$$ D 2.Hitoshi Omori & Jesse Alama - 2018 - Studia Logica 106 (6):1163-1180.
    We outline the rather complicated history of attempts at axiomatizing Jaśkowski’s discussive logic $$\mathbf {D_2}$$ D2 and show that some clarity can be had by paying close attention to the language we work with. We then examine the problem of axiomatizing $$\mathbf {D_2}$$ D2 in languages involving discussive conjunctions. Specifically, we show that recent attempts by Ciuciura are mistaken. Finally, we present an axiomatization of $$\mathbf {D_2}$$ D2 in the language Jaśkowski suggested in his second paper on discussive logic, by (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A modal extension of Jaśkowski’s discussive logic $\textbf{D}_\textbf{2}$.Krystyna Mruczek-Nasieniewska, Marek Nasieniewski & Andrzej Pietruszczak - 2019 - Logic Journal of the IGPL 27 (4):451-477.
    In Jaśkowski’s model of discussion, discussive connectives represent certain interactions that can hold between debaters. However, it is not possible within the model for participants to use explicit modal operators. In the paper we present a modal extension of the discussive logic $\textbf{D}_{\textbf{2}}$ that formally corresponds to an extended version of Jaśkowski’s model of discussion that permits such a use. This logic is denoted by $\textbf{m}\textbf{D}_{\textbf{2}}$. We present philosophical motivations for the formulation of this logic. We also give syntactic characterizations (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On quantity of logical values in the discussive D2 system and in modular logic.Jerzy Kotas - 1974 - Studia Logica 33 (3):273-275.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Some paraconsistent sentential calculi.Jerzy J. Błaszczuk - 1984 - Studia Logica 43 (1-2):51 - 61.
    In [8] Jakowski defined by means of an appropriate interpretation a paraconsistent calculusD 2 . In [9] J. Kotas showed thatD 2 is equivalent to the calculusM(S5) whose theses are exactly all formulasa such thatMa is a thesis ofS5. The papers [11], [7], [3], and [4] showed that interesting paraconsistent calculi could be obtained using modal systems other thanS5 and modalities other thanM. This paper generalises the above work. LetA be an arbitrary modality (i.e. string ofM''s,L''s and negation signs). Then (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modal logics connected with systems S4n of Sobociński.Jerzy J. Blaszczuk & Wieslaw Dziobiak - 1977 - Studia Logica 36 (3):151-164.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On detachment-substitutional formalization in normal modal logics.Wieslaw Dziobiak - 1977 - Studia Logica 36 (3):165 - 171.
    The aim of this paper is to propose a criterion of finite detachment-substitutional formalization for normal modal systems. The criterion will comprise only those normal modal systems which are finitely axiomatizable by means of the substitution, detachment for material implication and Gödel rules.
    Download  
     
    Export citation  
     
    Bookmark