14 found
Sort by:
  1. Tomasz Kowalski (2014). BCK is Not Structurally Complete. Notre Dame Journal of Formal Logic 55 (2):197-204.
    We exhibit a simple inference rule, which is admissible but not derivable in BCK, proving that BCK is not structurally complete. The argument is proof-theoretical.
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Robert Goldblatt & Tomasz Kowalski (2012). The Power of a Propositional Constant. Journal of Philosophical Logic (1):1-20.
    Monomodal logic has exactly two maximally normal logics, which are also the only quasi-normal logics that are Post complete, and they are complete for validity in Kripke frames. Here we show that addition of a propositional constant to monomodal logic allows the construction of continuum many maximally normal logics that are not valid in any Kripke frame, or even in any complete modal algebra. We also construct continuum many quasi-normal Post complete logics that are not normal. The set of extensions (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Bakhadyr Khoussainov & Tomasz Kowalski (2012). Computable Isomorphisms of Boolean Algebras with Operators. Studia Logica 100 (3):481-496.
    In this paper we investigate computable isomorphisms of Boolean algebras with operators (BAOs). We prove that there are examples of polymodal Boolean algebras with finitely many computable isomorphism types. We provide an example of a polymodal BAO such that it has exactly one computable isomorphism type but whose expansions by a constant have more than one computable isomorphism type. We also prove a general result showing that BAOs are complete with respect to the degree spectra of structures, computable dimensions, expansions (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Tomasz Kowalski, Francesco Paoli & Matthew Spinks (2011). Quasi-Subtractive Varieties. Journal of Symbolic Logic 76 (4):1261-1286.
    Varieties like groups, rings, or Boolean algebras have the property that, in any of their members, the lattice of congruences is isomorphic to a lattice of more manageable objects, for example normal subgroups of groups, two-sided ideals of rings, filters (or ideals) of Boolean algebras.algebraic logic can explain these phenomena at a rather satisfactory level of generality: in every member A of a τ-regular variety the lattice of congruences of A is isomorphic to the lattice of deductive filters on (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Tomasz Kowalski (2008). Self-Implications in BCI. Notre Dame Journal of Formal Logic 49 (3):295-305.
    Humberstone asks whether every theorem of BCI provably implies $\phi\to\phi$ for some formula $\phi$. Meyer conjectures that the axiom $\mathbf{B}$ does not imply any such "self-implication." We prove a slightly stronger result, thereby confirming Meyer's conjecture.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono (2007). Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier.
    This is also where we begin investigating lattices of logics and varieties, rather than particular examples.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  7. Tomasz Kowalski (2007). Weakly Associative Relation Algebras Hold the Key to the Universe. Bulletin of the Section of Logic 36 (3/4):145-157.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Tomasz Kowalski & Sam Butchart (2006). A Note on Monothetic BCI. Notre Dame Journal of Formal Logic 47 (4):541-544.
    In "Variations on a theme of Curry," Humberstone conjectured that a certain logic, intermediate between BCI and BCK, is none other than monothetic BCI—the smallest extension of BCI in which all theorems are provably equivalent. In this note, we present a proof of this conjecture.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Tomasz Kowalski & Marcus Kracht (2006). Semisimple Varieties of Modal Algebras. Studia Logica 83 (1-3):351 - 363.
    In this paper we show that a variety of modal algebras of finite type is semisimple iff it is discriminator iff it is both weakly transitive and cyclic. This fact has been claimed already in [4] (based on joint work by the two authors) but the proof was fatally flawed.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  10. Tomasz Kowalski (2004). Retraction Note for "Pdl has Interpolation". Journal of Symbolic Logic 69 (3):935-935.
  11. Tomasz Kowalski (2004). Semisimplicity, EDPC and Discriminator Varieties of Residuated Lattices. Studia Logica 77 (2):255 - 265.
    We prove that all semisimple varieties of FL ew-algebras are discriminator varieties. A characterisation of discriminator and EDPC varieties of FL ew-algebras follows. It matches exactly a natural classification of logics over FL ew proposed by H. Ono.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Tomasz Kowalski (2002). PDL has Interpolation. Journal of Symbolic Logic 67 (3):933-946.
    It is proved that free dynamic algebras superamalgamate. Craig interpolation for propositional dynamic logic and superamalgamation for the variety of dynamic algebras follow.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Tomasz Kowalski (2001). Propositional Dynamic Logic has Interpolation. Bulletin of the Section of Logic 30 (1):33-39.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  14. Marcus Kracht & Tomasz Kowalski (2001). Atomic Incompleteness or How to Kill One Bird with Two Stones. Bulletin of the Section of Logic 30 (2):71-78.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation