Switch to: References

Add citations

You must login to add citations.
  1. Fragments of R-Mingle.W. J. Blok & J. G. Raftery - 2004 - Studia Logica 78 (1-2):59-106.
    The logic RM and its basic fragments (always with implication) are considered here as entire consequence relations, rather than as sets of theorems. A new observation made here is that the disjunction of RM is definable in terms of its other positive propositional connectives, unlike that of R. The basic fragments of RM therefore fall naturally into two classes, according to whether disjunction is or is not definable. In the equivalent quasivariety semantics of these fragments, which consist of subreducts of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A deduction theorem schema for deductive systems of propositional logics.Janusz Czelakowski & Wies?aw Dziobiak - 1991 - Studia Logica 50 (3-4):385 - 390.
    We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Non-existence of a countable strongly adequate matrix semantics for neighbours of E.Wies law Dziobiak - 1981 - Bulletin of the Section of Logic 10 (4):170-174.
    Download  
     
    Export citation  
     
    Bookmark  
  • Singly generated quasivarieties and residuated structures.Tommaso Moraschini, James G. Raftery & Johann J. Wannenburg - 2020 - Mathematical Logic Quarterly 66 (2):150-172.
    A quasivariety of algebras has the joint embedding property (JEP) if and only if it is generated by a single algebra A. It is structurally complete if and only if the free ℵ0‐generated algebra in can serve as A. A consequence of this demand, called ‘passive structural completeness’ (PSC), is that the nontrivial members of all satisfy the same existential positive sentences. We prove that if is PSC then it still has the JEP, and if it has the JEP and (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the degree of complexity of sentential logics. A couple of examples.Jacek Hawranek & Jan Zygmunt - 1981 - Studia Logica 40 (2):141 - 153.
    The first part of the paper is a reminder of fundamental results connected with the adequacy problem for sentential logics with respect to matrix semantics. One of the main notions associated with the problem, namely that of the degree of complexity of a sentential logic, is elucidated by a couple of examples in the second part of the paper. E.g., it is shown that the minimal logic of Johansson and some of its extensions have degree of complexity 2. This is (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On matrices characteristic of relevant logics.Wies law Dziobiak - 1981 - Bulletin of the Section of Logic 10 (3):113-114.
    Download  
     
    Export citation  
     
    Bookmark