6 found
Order:
  1.  41
    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   27 citations  
  2.  30
    Computational complexity for bounded distributive lattices with negation.Dmitry Shkatov & C. J. Van Alten - 2021 - Annals of Pure and Applied Logic 172 (7):102962.
    We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  21
    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.
  4.  36
    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  
  5.  36
    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   2 citations  
  6.  21
    Complexity of the Universal Theory of Residuated Ordered Groupoids.Dmitry Shkatov & C. J. Van Alten - 2023 - Journal of Logic, Language and Information 32 (3):489-510.
    We study the computational complexity of the universal theory of residuated ordered groupoids, which are algebraic structures corresponding to Nonassociative Lambek Calculus. We prove that the universal theory is co $$\textsf {NP}$$ -complete which, as we observe, is the lowest possible complexity for a universal theory of a non-trivial class of structures. The universal theories of the classes of unital and integral residuated ordered groupoids are also shown to be co $$\textsf {NP}$$ -complete. We also prove the co $$\textsf {NP}$$ (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark