5 found
Order:
  1.  10
    Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
    Hereditary structural completeness is established for a range of substructural logics, mainly without the weakening rule, including fragments of various relevant or many-valued logics. Also, structural completeness is disproved for a range of systems, settling some previously open questions.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  2.  8
    An Algebraic Look at Filtrations in Modal Logic.W. Conradie, W. Morton & C. J. van Alten - 2013 - Logic Journal of the IGPL 21 (5):788-811.
  3.  32
    On Varieties of Biresiduation Algebras.C. J. van Alten - 2006 - Studia Logica 83 (1-3):425-445.
    A biresiduation algebra is a 〈/,\,1〉-subreduct of an integral residuated lattice. These algebras arise as algebraic models of the implicational fragment of the Full Lambek Calculus with weakening. We axiomatize the quasi-variety B of biresiduation algebras using a construction for integral residuated lattices. We define a filter of a biresiduation algebra and show that the lattice of filters is isomorphic to the lattice of B-congruences and that these lattices are distributive. We give a finite basis of terms for generating filters (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4. Embedding Theorems and Rule Separation in Logics Without Weakening.C. J. van Alten & J. G. Raftery - 2004 - Studia Logica 76 (2).
     
    Export citation  
     
    Bookmark   4 citations  
  5.  8
    The Finite Model Property for Knotted Extensions of Propositional Linear Logic.C. J. van Alten - 2005 - Journal of Symbolic Logic 70 (1):84-98.
    The logics considered here are the propositional Linear Logic and propositional Intuitionistic Linear Logic extended by a knotted structural rule: γ, xn → y / γ, xm → y. It is proved that the class of algebraic models for such a logic has the finite embeddability property, meaning that every finite partial subalgebra of an algebra in the class can be embedded into a finite full algebra in the class. It follows that each such logic has the finite model property (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation