# Search results

Commentationes Mathematicae > 2019 > 59 > 1-2

Commentationes Mathematicae > 2019 > 59 > 1-2

Commentationes Mathematicae > 2019 > 59 > 1-2

In this paper we generalize Jacobsthal quaternions to \((s,p)\)\dywiz Jacobsthal quaternions. We give some of their properties, among others the Binet formula, the generating function and the matrix representation of these quaternions. We will show how a~graph interpretation can be used in proving some identities for quaternions.

Commentationes Mathematicae > 2019 > 59 > 1-2

We present some classification results for n-derivations over certain commutative rings.

In this paper, by considering the notion of MV-module, which is the structure that naturally correspond to lu-modules over lu-rings, we study injective MV-modules and we investigate some conditions for constructing injective MV-modules. Then we define the notions of essential A-homomorphisms and essential extension of A-homomorphisms, where A is a product MV-algebra, and we get some of there properties...

In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical theories via rules of special sort was developed successfully by Negri and von Plato. In this paper a general theorem on possible ways of transforming axiomatic sequents into rules...

Orthologic (OL) is non-classical logic and has been studied as a part of quantumlogic. OL is based on an ortholattice and is also called minimal quantum logic. Sequent calculus is used as a tool for proof in logic and has been examinedfor several decades. Although there are many studies on sequent calculus forOL, these sequent calculi have some problems. In particular, they do not includeimplication...

We formulate a certain subtheory of Ishimoto’s [1] quantifier-free fragment of Leśniewski’s ontology, and show that Ishimoto’s theory can be reconstructed in it. Using an epimorphism theorem we prove that our theory is complete with respect to a suitable set-theoretic interpretation. Furthermore, we introduce the name constant 1 (which corresponds to the universal name ‘object’) and we prove its adequacy...

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.

The paper introduces the concept of B-Almost distributive fuzzy lattice (BADFL) in terms of its principal ideal fuzzy lattice. Necessary and sufficient conditions for an ADFL to become a B-ADFL are investigated. We also prove the equivalency of B-algebra and B-fuzzy algebra. In addition, we extend PSADL to PSADFL and prove that B-ADFL implies PSADFL.

This article is a continuation of our promenade along the winding roads of identity, equality, nameability and completeness. We continue looking for a place where all these concepts converge. We assume that identity is a binary relation between objects while equality is a symbolic relation between terms. Identity plays a central role in logic and we have looked at it from two different points of view...

We prove that there is infinitely many tabular modal logics extending KB.Alt(2) which have interpolation.

This is a spin-off paper to [3, 4] in which we carried out an extensive analysis of Andrzej Grzegorczyk’s point-free topology from [5]. In [1] Loredana Biacino and Giangiacomo Gerla presented an axiomatization which was inspired by the Grzegorczyk’s system, and which is its variation. Our aim is to compare the two approaches and show that they are slightly different. Except for pointing to dissimilarities,...

We characterize the non-trivial substructural logics having the variable sharing property as well as its strong version. To this end, we find the algebraic counterparts over varieties of these logical properties.

We provide simple algebraic proofs of two important facts, due to Zakharyaschev and Esakia, about Grzegorczyk algebras.

Modal pseudocomplemented De Morgan algebras (or mpM-algebras) were investigated in A. V. Figallo, N. Oliva, A. Ziliani, Modal pseudocomplemented De Morgan algebras, Acta Univ. Palacki. Olomuc., Fac. rer. nat., Mathematica 53, 1 (2014), pp. 65–79, and they constitute a proper subvariety of the variety of pseudocomplemented De Morgan algebras satisfying xΛ(∼x)* = (∼(xΛ(∼x)*))* studied by H. Sankappanavar...

This work adapts techniques and results first developed by Malinowski and by Marek in the context of referential semantics of sentential logics to the context of logics formalized as π-institutions. More precisely, the notion of a pseudoreferential matrix system is introduced and it is shown how this construct generalizes that of a referential matrix system. It is then shown that every π–institution...

In this paper we study pseudo-BCH algebras which are semilattices or lattices with respect to the natural relations ≤; we call them pseudo-BCH join-semilattices, pseudo-BCH meet-semilattices and pseudo-BCH lattices, respectively. We prove that the class of all pseudo-BCH join-semilattices is a variety and show that it is weakly regular, arithmetical at 1, and congruence distributive. In addition,...

We present the history of the conference Applications of Algebra in Logic and Computer Science, whose twenty-third edition will be held in March, 2019. At the end we outline some plans for the future.

The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the axiom 4). This article aims, firstly, at providing both a model-theoretic and a proof-theoretic characterisation of a four-valued extension of the temporal logic KtT4 and, secondly,...

The notion of (implicative) int-soft ideal in a pseudo MV -algebra is introduced, and related properties are investigated. Conditions for a soft set to be an int-soft ideal are provided. Characterizations of (implicative) int-soft ideal are considered. The extension property for implicative int-soft ideal is established.

In this paper, we define the notion of PC-lattice, as a generalization of finite positive implicative BCK-algebras with condition (S) and bounded commutative BCK-algebras. We investiate some results for Pc-lattices being a new class of BCK-lattices. Specially, we prove that any Boolean lattice is a PC-lattice and we show that if X is a PC-lattice with condition S, then X is an involutory BCK-algebra...