arXiv subjects
Publications and source records attributed to Wojciech Dzik.
We consider the two-pronged fork frame $F$ and the variety $\mathbf{Eq}(B_F)$ generated by its dual closure algebra $B_F$. We describe the finite projective algebras in $\mathbf{Eq}(B_F)$ and give a purely semantic proof that unification in $\mathbf{Eq}(B_F)$ is finitary and not unitary.
The purpose of this note is to shed some light on the preservation of unification types of locally finite varieties of interior algebras and varieties of Heyting algebras under the functors presented by W. Blok in his dissertation.
We consider varieties generated by finite closure algebras whose canonical relations have two levels, and whose restriction to a level is an "extremal" relation, i.e. the identity or the universal relation. The corresponding logics have frames of depth two, in which a level consists of a set of simple clusters or of one cluster with one or more elements.
We investigate the join semilattice of modal operators on a Boolean algebra $B$. Furthermore, we consider pairs $(f,g)$ of modal operators whose supremum is the unary discriminator on $B$, and study the associated bi--modal algebras.
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e. rules that can not be applied to theorems of the system. Neglecting passive rules leads to the notion of almost structural completeness, that means, derivablity of admissible non-passive rules. Almost structural completeness for quasivarieties and varieties of general algebras is investigated here by purely algebraic means. The results apply to all algebraizable deductive systems. Firstly, various characterizations of almost structurally complete quasivarieties are presented. Two of them are general: expressed with finitely presented algebras, and with subdirectly irreducible algebras. One is restricted to quasivarieties with finite model property and equationally definable principal relative congruences, where the condition is verifiable on finite subdirectly irreducible algebras. Secondly, examples of almost structurally complete varieties are provided Particular emphasis is put on varieties of closure algebras, that are known to constitute adequate semantics for normal extensions of S4 modal logic. A certain infinite family of such almost structurally complete, but not structurally complete, varieties is constructed. Every variety from this family has a finitely presented unifiable algebra which does not embed into any free algebra for this variety. Hence unification in it is not unitary. This shows that almost structural completeness is strictly weaker than projective unification for varieties of closure algebras.
We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of intermediate logic with a Galois connection ${\sf LGC}$, and then interlinking their operators by two Fischer Servi axioms. The resulting system is called here ${\sf L2GC{+}FS}$. In the cases of intuitionistic logic ${\sf Int}$ and classical logic ${\sf Cl}$, it is noted that ${\sf Int2GC{+}FS}$ is syntactically equivalent to intuitionistic minimal tense logic ${\sf IK_t}$ by W. B. Ewald and ${\sf Cl2GC{+}FS}$ equals classical minimal tense logic ${\sf K_t}$. This justifies to consider ${\sf L2GC{+}FS}$ as minimal ${\sf L}$-tense logic ${\sf LK_t}$ for any intermediate logic ${\sf L}$. We define H2GC+FS-algebras as expansions of HK1-algebras, introduced by E. Orlowska and I. Rewitzky. For each intermediate logic ${\sf L}$, we show algebraic completeness of ${\sf L2GC{+}FS}$ and its conservativeness over ${\sf L}$. We prove relational completeness of ${\sf Int2GC{+}FS}$ with respect to the models defined on ${\sf IK}$-frames introduced by G. Fischer Servi. We also prove a representation theorem stating that every H2GC+FS-algebra can be embedded into the complex algebra of its canonical ${\sf IK}$-frame.
This paper studies expansions of bounded distributive lattices equipped with a Galois connection. We introduce GC-frames and canonical frames for these algebras. The complex algebras of GC-frames are defined in terms of rough set approximation operators. We prove that each bounded distributive lattice with a Galois connection can be embedded into the complex algebra of its canonical frame. We show that for every spatial Heyting algebra $L$ equipped with a Galois connection, there exists a GC-frame such that $L$ is isomorphic to the complex algebra of this frame, and an analogous result holds for weakly atomic Heyting-Brouwer algebras with a Galois connection. In each case of representation, given Galois connections are represented by rough set upper and lower approximations.
Earlier, the authors introduced the logic IntGC, which is an extension of intuitionistic propositional logic by two rules of inference mimicking the performance of Galois connections (Logic J. of the IGPL, 18:837-858, 2010). In this paper, the extensions Int2GC and Int2GC+FS of IntGC are studied. Int2GC can be seen as a fusion of two IntGC logics, and Int2GC+FS is obtained from Int2GC by adding instances of duality-like connections $\Diamond(A \to\ B) \to (\Box A \to \Diamond B)$ and $(\Diamond A \to \Box B) \to \Box(A \to B)$, introduced by G. Fischer Servi (Rend. Sem. Mat. Univers. Politecn. Torino, 42:179-194, 1984), for interlinking the two Galois connections of Int2GC. Both Kripke-style and algebraic semantics are presented for Int2GC and Int2GC+FS, and the logics are proved to be complete with respect to both of these semantics. We show that rough lattice-valued fuzzy sets defined on complete Heyting algebras are proper algebraic models for Int2GC+FS. We also prove that Int2GC+FS is equivalent to the intuitionistic tense logic IKt, and an axiomatisation of IKt with the number of axioms reduced to the half of the number of axioms given by W. B. Ewald (J. Symb. Log, 51:166-179, 1986) is presented.
We show that the intuitionistic propositional logic with a Galois connection (IntGC), introduced by the authors, has the finite model property.