Switch to: References

Add citations

You must login to add citations.
  1. $$\varvec{Brings~It~About~That}$$ Operators Decomposed with Relating Semantics.Tomasz Jarmużek, Mateusz Klonowski & Piotr Kulicki - 2024 - Studia Logica 112 (3):541-559.
    In the paper we examine the problem of logical systems that are extensions of Classical Propositional Logic with new, intensional connectives of agency: monadic and dyadic bringing it about that. These systems are usually studied within the neighbourhood semantics. Here we propose a different strategy. We study all of the accepted laws and rules of logic of agency and define a translation of the agency operators into connectives interpreted in relating semantics. After this translation we can make a reduction to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Boolean Connexive Logic and Content Relationship.Mateusz Klonowski & Luis Estrada-González - 2023 - Studia Logica 112 (1):207-248.
    We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Hyperintensionality and Fine-Grained Semantics.Aleksander Parol - 2023 - Studia Logica 111 (6):1083-1087.
    Download  
     
    Export citation  
     
    Bookmark  
  • Axiomatization of BLRI Determined by Limited Positive Relational Properties.Tomasz Jarmużek & Mateusz Klonowski - forthcoming - Logic and Logical Philosophy:1-29.
    In the paper a generalised method for obtaining an adequate axiomatic system for any relating logic expressed in the language with Boolean connectives and relating implication, determined by the limited positive relational properties is studied. The method of defining axiomatic systems for logics of a given type is called an algorithm since the analysis allows for any logic determined by the limited positive relational properties to define the adequate axiomatic system automatically, step-by-step. We prove in the paper that the algorithm (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Applications of Relating Semantics.Tomasz Jarmużek & Francesco Paoli - forthcoming - Logic and Logical Philosophy:1-17.
    Here, we discuss logical, philosophical and technical problems associated to relating logic and relating semantics. To do so, we proceed in three steps. The first step is devoted to providing an introduction to both relating logic and relating semantics. We discuss this problem on the example of different languages. Second, we address some of the main research directions and their philosophical applications to non-classical logics, particularly to connexive logics. Third, we discuss some technical problems related to relating semantics, and its (...)
    Download  
     
    Export citation  
     
    Bookmark