Switch to: References

Add citations

You must login to add citations.
  1. A comparison between monoidal and substructural logics.Clayton Peterson - 2016 - Journal of Applied Non-Classical Logics 26 (2):126-159.
    Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The purpose of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Labelled Deductive System for Relational Semantics of the Lambek Calculus.Miroslawa Kolowska-Gawiejnowicz - 1999 - Mathematical Logic Quarterly 45 (1):51-58.
    We present a labelled version of Lambek Calculus without unit, and we use it to prove a completeness theorem for Lambek Calculus with respect to some relational semantics.
    Download  
     
    Export citation  
     
    Bookmark  
  • Powerset residuated algebras.Mirosława Kołowska-Gawiejnowicz - 2014 - Logic and Logical Philosophy 23 (1):69-80.
    We present an algebraic approach to canonical embeddings of arbitrary residuated algebras into powerset residuated algebras. We propose some construction of powerset residuated algebras and prove a representation theorem for symmetric residuated algebras.
    Download  
     
    Export citation  
     
    Bookmark  
  • The categorical imperative: Category theory as a foundation for deontic logic.Clayton Peterson - 2014 - Journal of Applied Logic 12 (4):417-461.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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}$$ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Interpolation and FEP for logics of residuated algebras.Wojciech Buszkowski - 2011 - Logic Journal of the IGPL 19 (3):437-454.
    A residuated algebra is a generalization of a residuated groupoid; instead of one basic binary operation with residual operations \,/, it admits finitely many basic operations, and each n-ary basic operation is associated with n residual operations. A logical system for RAs was studied in e.g. [6, 8, 15, 16] under the name: Generalized Lambek Calculus GL. In this paper we study GL and its extensions in the form of sequent systems. We prove an interpolation property which allows to replace (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Representation Theorems for Implication Structures.Wojciech Buszkowski - 1996 - Bulletin of the Section of Logic 25:152-158.
    Download  
     
    Export citation  
     
    Bookmark   1 citation