30 found
Order:
  1.  64
    Residuated Lattices: An Algebraic Glimpse at Substructural Logics.Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski & Hiroakira Ono - 2007 - Elsevier.
    This is also where we begin investigating lattices of logics and varieties, rather than particular examples.
    Direct download  
     
    Export citation  
     
    Bookmark   73 citations  
  2.  66
    Analytic Cut and Interpolation for Bi-Intuitionistic Logic.Tomasz Kowalski & Hiroakira Ono - 2017 - Review of Symbolic Logic 10 (2):259-283.
    We prove that certain natural sequent systems for bi-intuitionistic logic have the analytic cut property. In the process we show that the (global) subformula property implies the (local) analytic cut property, thereby demonstrating their equivalence. Applying a version of Maehara technique modified in several ways, we prove that bi-intuitionistic logic enjoys the classical Craig interpolation property and Maximova variable separation property; its Halldén completeness follows.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  3.  59
    Outcomes in branching space-time and GHZ-Bell theorems.Tomasz Kowalski & Tomasz Placek - 1999 - British Journal for the Philosophy of Science 50 (3):349-375.
    The paper intends to provide an algebraic framework in which subluminal causation can be analysed. The framework merges Belnap's 'outcomes in branching time' with his 'branching space-time' (BST). it is shown that an important structure in BST, called 'family of outcomes of an event', is a boolean algebra. We define next non-stochastic common cause and analyse GHZ-Bell theorems. We prove that there is no common cause that accounts for results of GHZ-Bell experiment but construct common causes for two other quantum (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  4.  70
    (1 other version)The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - 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)  
     
    Export citation  
     
    Bookmark   8 citations  
  5.  50
    Semisimplicity, EDPC and discriminator varieties of residuated lattices.Tomasz Kowalski - 2004 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  6. Varieties Of Tense Algebras.Tomasz Kowalski - 1998 - Reports on Mathematical Logic:53-95.
    The paper has two parts preceded by quite comprehensive preliminaries.In the first part it is shown that a subvariety of the variety ${\cal T}$ of all tense algebras is discriminator if and only if it is semisimple. The variety ${\cal T}$ turns out to be the join of an increasing chain of varieties ${\cal D}_n$, which are discriminator varieties. The argument carries over to all finite type varieties of boolean algebras with operators satisfying some term conditions. In the case of (...)
     
    Export citation  
     
    Bookmark   9 citations  
  7.  26
    Semisimple Varieties of Modal Algebras.Tomasz Kowalski & Marcus Kracht - 2006 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  8.  24
    Uniform interpolation and coherence.Tomasz Kowalski & George Metcalfe - 2019 - Annals of Pure and Applied Logic 170 (7):825-841.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. On some properties of quasi MV algebras and square root quasi MV algebras. Part III.Franchesco Paoli & Tomasz Kowalski - 2010 - Reports on Mathematical Logic:161-199.
     
    Export citation  
     
    Bookmark   4 citations  
  10.  26
    A Note on Monothetic BCI.Tomasz Kowalski & Sam Butchart - 2006 - 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)  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  34
    Computable Isomorphisms of Boolean Algebras with Operators.Bakhadyr Khoussainov & Tomasz Kowalski - 2012 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12. The Variety Of Residuated Lattices Is Generated By Its Finite Simple Members.Tomasz Kowalski & Hiroakira Ono - 2000 - Reports on Mathematical Logic:59-77.
    We show that the variety of residuated lattices is generated by its finite simple members, improving upon a finite model property result of Okada and Terui. The reasoning is a blend of proof-theoretic and algebraic arguments.
     
    Export citation  
     
    Bookmark   5 citations  
  13.  24
    BCK is not Structurally Complete.Tomasz Kowalski - 2014 - 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 (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14. The bottom of the lattice of BCK-varieties.Tomasz Kowalski - 1995 - Reports on Mathematical Logic:87-93.
  15.  33
    Self-implications in BCI.Tomasz Kowalski - 2008 - 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 (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  23
    Weakly associative relation algebras hold the key to the universe.Tomasz Kowalski - 2007 - Bulletin of the Section of Logic 36 (3/4):145-157.
  17.  52
    Quasi-subtractive varieties.Tomasz Kowalski, Francesco Paoli & Matthew Spinks - 2011 - 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 (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18. A Syntactic Proof Of A Conjecture Of Andrzej Wronski.Tomasz Kowalski - 1994 - Reports on Mathematical Logic:81-86.
    A syntactic derivation of Cornish identity from the axioms of HBCK is presented which amounts to a syntactic proof of Wronski's conjecture that naturally ordered BCK-algebras form a variety.
    No categories
     
    Export citation  
     
    Bookmark   3 citations  
  19.  41
    An Abelian Rule for BCI—and Variations.Tomasz Kowalski & Lloyd Humberstone - 2016 - Notre Dame Journal of Formal Logic 57 (4):551-568.
    We show the admissibility for BCI of a rule form of the characteristic implicational axiom of abelian logic, this rule taking us from →β to α. This is done in Section 8, with surrounding sections exploring the admissibility and derivability of various related rules in several extensions of BCI.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  11
    Omitting types theorem in hybrid dynamic first-order logic with rigid symbols.Daniel Găină, Guillermo Badia & Tomasz Kowalski - 2023 - Annals of Pure and Applied Logic 174 (3):103212.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. On the BCI-Admissibility of an 'Abelian' Rule.Lloyd Humberstone & Tomasz Kowalski - unknown
    Am(B m B). Specifically I was wondering whether for every BCI-provable formula A there is a B for which the inset formula was provable. If you want to read about this issue, which I..
    No categories
     
    Export citation  
     
    Bookmark  
  22. Almost minimal varieties related to fuzzy logic.Yosuke Katoh, Tomasz Kowalski & Masaki Ueda - 2006 - Reports on Mathematical Logic.
     
    Export citation  
     
    Bookmark   1 citation  
  23. A Finite Fragment Of S3.Tomasz Kowalski & John Slaney - 2008 - Reports on Mathematical Logic.
    It is shown that the pure implication fragment of the modal logic [3], pp. 385--387) has finitely many non-equivalent formulae in one variable. The exact number of such formulae is not known. We show that this finiteness result is the best possible, since the analogous fragment of S4, and therefore of [3], in two variables has infinitely many non-equivalent formulae.
     
    Export citation  
     
    Bookmark   1 citation  
  24.  15
    Free lattices proof-theoretically.Tomasz Kowalski - 2020 - Australasian Journal of Logic 17 (2):110-122.
    A sequent system is used to give alternative proofs of two well known properties of free lattices: Whitman’s condition and semidistributivity. It demonstrates usefulness of such proof systems outside logic.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  31
    Propositional Dynamic Logic has interpolation.Tomasz Kowalski - 2001 - Bulletin of the Section of Logic 30 (1):33-39.
  26.  41
    PDL has interpolation.Tomasz Kowalski - 2002 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27. Pretabular Varieties Of Equivalential Algebras.Tomasz Kowalski - 1999 - Reports on Mathematical Logic:3-10.
    It is shown that there are precisely two pretabular varieties of equivalential algebras.
     
    Export citation  
     
    Bookmark  
  28.  53
    Retraction note for "pdl has interpolation".Tomasz Kowalski - 2004 - Journal of Symbolic Logic 69 (3):935-935.
  29. Remarks on splittings in the variety of residuated lattices.Tomasz Kowalski & Hiroakira Ono - 2000 - Reports on Mathematical Logic:133-140.
     
    Export citation  
     
    Bookmark   1 citation  
  30.  25
    Atomic incompleteness or how to kill one bird with two stones.Marcus Kracht & Tomasz Kowalski - 2001 - Bulletin of the Section of Logic 30 (2):71-78.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation