A commutative BCK-algebra with the relative cancellation property is a commutative BCK-algebra (X;*,0) which satisfies the condition: if a ≤ x, a ≤ y and x * a = y * a, then x = y. Such BCK-algebras form a variety, and the category of these BCK-algebras is categorically equivalent to the category of Abelian ℓ-groups whose objects are pairs (G, G 0), where G is an Abelian ℓ-group, G 0 is a subset of the positive cone generating (...) G + such that if u, v ∈ G 0, then 0 ∨ (u - v) ∈ G 0, and morphisms are ℓ-group homomorphisms h: (G, G 0) → (G′,G′0) with f(G 0) ⫅ G′0. Our methods in particular cases give known categorical equivalences of Cornish for conical BCK-algebras and of Mundici for bounded commutative BCK-algebras (= MV-algebras). (shrink)

In this paper we prove that the equational class generated by bounded BCK-algebras is the variety generated by the class of finite simple bounded BCK-algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK-algebras is also a relatively simple bounded BCK-algebra. Moreover, we show that every simple bounded BCK-algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results (...) to some richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (shrink)

In this paper we prove that the equational class generated by bounded BCK-algebras is the variety generated by the class of finite simple bounded BCK-algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK-algebras is also a relatively simple bounded BCK-algebra. Moreover, we show that every simple bounded BCK-algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results (...) to some richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

In this paper, we define the notion of PC-lattice, as a generalization of finite positive implicative BCK-algebras with condition 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 if and only if X is a commutative BCK-algebra. Finally, we prove that any PC-lattice (...) with condition is a distributive BCK-algebra. (shrink)

In [9] it is proved the categorical isomorphism of two varieties: bounded commutative BCK-algebras and MV -algebras. The class of MV -algebras is the algebraic counterpart of the infinite valued propositional calculus L of Lukasiewicz . The main objective of the present paper is to study that isomorphism from the perspective of logic. The B-C-K logic is algebraizable and the quasivariety of BCKalgebras is the equivalent algebraic semantics for that logic . We call commutative B-C-K logic, briefly (...) cBCK, to the extension of B-C-K logic associated to the variety of commutative BCK–algebras. Moreover, we present the extension Boc of cBCK obtained by adding the axiom of “boundness”. We prove that the deductive system Boc is equivalent to L. We observe that cBCK admits two interesting extensions: the logic Boc, treated in this paper, which is equivalent to the system L of Lukasiewicz, and the logic Co that is naturally associated to the system Balo of `-groups . This constructions establish a link between L and Balo , that would be a logical approach to the categorical relationship between MV–algebras and `-groups. (shrink)

We discuss the interrelations between BCK-algebras and posets with difference. Applications are given to bounded commutative BCK-algebras, difference posets, MV-algebras, quantum MV-algebras and orthoalgebras.

This main aim of this paper is to prove that in a direct commutative BCK-algebra an ideal I is nitely generated if and only if I is a principal ideal. This result generalizes the result obtained by E. Y. Deeba in [2]. We also give an answer to the question posed by E. Y. Deeba in [1]: for what class of BCK-algebras is every Noetherian algebra a principal ideal algebra ?

In this paper we characterize the MV-algebras containing as subalgebras Post algebras of finitely many orders. For this we study cyclic elements in MV-algebras which are the generators of the fundamental chain of the Post algebras.

The notions of a C-energetic subset and permeable C-value in BCK-algebras are introduced, and related properties are investigated. Conditions for an element t in [0, 1] to be an permeable C-value are provided. Also conditions for a subset to be a C-energetic subset are discussed. We decompose BCK-algebra by a partition which consists of a C-energetic subset and a commutative ideal.

Formally, a description of weak BCK-algebras can be obtained by replacing the first BCK axiom \ - \le z - y}\) by its weakening \. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We consider weak BCK-algebras with De Morgan complemented, orthocomplemented and orthomodular sections, as well as those where sections satisfy a certain compatibility condition, and characterize each of these classes of algebras by an equation or quasi-equation. For instance, those (...) weak BCK-algebras in which all initial segments are De Morgan complemented are just commutative weak BCK-algebras. (shrink)

In this paper we consider twelve classical laws of negation and study their relations in the context of BCK-algebras. A classification of the laws of negation is established and some characterizations are obtained. For example, using the concept of translation we obtain some characterizations of Hilbert algebras and commutative BCK-algebras with minimum. As a consequence we obtain a theorem relating those algebras to Boolean algebras.

The notions of a commutative (∈, ∈)-neutrosophic ideal and a commutative falling neutrosophic ideal are introduced, and several properties are investigated. Characterizations of a commutative (∈, ∈)-neutrosophic ideal are obtained. Relations between commutative (∈, ∈)-neutrosophic ideal and (∈, ∈)-neutrosophic ideal are discussed. Conditions for an (∈, ∈)-neutrosophic ideal to be a commutative (∈, ∈)-neutrosophic ideal are established. Relations between commutative (∈, ∈)-neutrosophic ideal, falling neutrosophic ideal and commutative falling neutrosophic ideal are considered. Conditions (...) for a falling neutrosophic ideal to be commutative are provided. (shrink)

Quantum B-algebras, the partially ordered implicational algebras arising as subreducts of quantales, are introduced axiomatically. It is shown that they provide a unified semantic for non-commutative algebraic logic. Specifically, they cover the vast majority of implicational algebras like BCK-algebras, residuated lattices, partially ordered groups, BL- and MV-algebras, effect algebras, and their non-commutative extensions. The opposite of the category of quantum B-algebras is shown to be equivalent to the category of logical quantales, in the way that every quantum B-algebra (...) admits a natural embedding into a logical quantale, the enveloping quantale. Partially defined products of algebras related to effect algebras are handled efficiently in this way. The unit group of the enveloping quantale of a quantum B-algebra X is shown to be always contained in X, which gives a functorial subgroup X× of X. Similar subfunctors are obtained for the non-commutative extensions of BCK-algebras and effect algebras. The results of Galatos, Jónsson, and Tsinakis on the splitting of generalized BL-algebras into a semidirect product of a partially ordered group operating on an integral residuated poset are extended to a characterization of twisted semidirect products of a po-group by a quantum B-algebra. (shrink)

Pseudo-BCK-algebras are a non-commutative generalization of well-known BCK-algebras. The paper describes a situation when a linearly ordered pseudo-BCK-algebra is an ordinal sum of linearly ordered cone algebras. In addition, we present two identities giving such a possibility of the decomposition and axiomatize the residuation subreducts of representable pseudo-hoops and pseudo-BL-algebras.

A symmetric residuated lattice is an algebra such that is a commutative integral bounded residuated lattice and the equations x=x and =xy are satisfied. The aim of the paper is to investigate the properties of the unary operation ε defined by the prescription εx=x→0. We give necessary and sufficient conditions for ε being an interior operator. Since these conditions are rather restrictive →0)=1 is satisfied) we consider when an iteration of ε is an interior operator. In particular we (...) consider the chain of varieties of symmetric residuated lattices such that the n iteration of ε is a boolean interior operator. For instance, we show that these varieties are semisimple. When n=1, we obtain the variety of symmetric stonean residuated lattices. We also characterize the subvarieties admitting representations as subdirect products of chains. These results generalize and in many cases also simplify, results existing in the literature. (shrink)

Let ${\mathbb{BRL}}$ denote the variety of commutative integral bounded residuated lattices (bounded residuated lattices for short). A Boolean retraction term for a subvariety ${\mathbb{V}}$ of ${\mathbb{BRL}}$ is a unary term t in the language of bounded residuated lattices such that for every ${{\bf A} \in \mathbb{V}, t^{A}}$ , the interpretation of the term on A, defines a retraction from A onto its Boolean skeleton B(A). It is shown that Boolean retraction terms are equationally definable, in the (...) sense that there is a variety ${\mathbb{V}_{t} \subsetneq \mathbb{BRL}}$ such that a variety ${\mathbb{V} \subsetneq \mathbb{BRL}}$ admits the unary term t as a Boolean retraction term if and only if ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ . Moreover, the equation s(x) = t(x) holds in ${\mathbb{V}_{s} \cap \mathbb{V}_{t}}$ . The radical of ${{\bf A} \in \mathbb{BRL}}$ , with the structure of an unbounded residuated lattice with the operations inherited from A expanded with a unary operation corresponding to double negation and a a binary operation defined in terms of the monoid product and the negation, is called the radical algebra of A. To each involutive variety ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ is associated a variety ${\mathbb{V}^{r}}$ formed by the isomorphic copies of the radical algebras of the directly indecomposable algebras in ${\mathbb{V}}$ . Each free algebra in such ${\mathbb{V}}$ is representable as a weak Boolean product of directly indecomposable algebras over the Stone space of the free Boolean algebra with the same number of free generators, and the radical algebra of each directly indecomposable factor is a free algebra in the associated variety ${\mathbb{V}^{r}}$ , also with the same number of free generators.A hierarchy of subvarieties of ${\mathbb{BRL}}$ admitting Boolean retraction terms is exhibited. (shrink)

This paper introduces the concept of single-valued neutrosophic hyper \(BCK\)-subalgebras as a generalization and alternative of hyper \(BCK\)-algebras and on any given nonempty set constructs at least one single-valued neutrosophic hyper \(BCK\)-subalgebra and one a single-valued neutrosophic hyper \(BCK\)-ideal. In this study level subsets play the main role in the connection between singlevalued neutrosophic hyper \(BCK\)-subalgebras and hyper \(BCK\)-subalgebras and the connection between single-valued neutrosophic hyper \(BCK\)-ideals and hyper \(BCK\)-ideals. The congruence and (strongly) regular equivalence relations are the important tools (...) for connecting hyperstructures and structures, so the major contribution of this study is to apply and introduce a (strongly) regular relation on hyper \(BCK\)-algebras and to investigate their categorical properties (quasi commutative diagram) via single-valued neutrosophic hyper \(BCK\)-ideals. Indeed, by using the single-valued neutrosophic hyper \(BCK\)-ideals, we define a congruence relation on (weak commutative) hyper \(BCK\)-algebras that under some conditions is strongly regular and the quotient of any (single-valued neutrosophic)hyper \(BCK\)-(sub)algebra via this relation is a (single-valued neutrosophic)(hyper \(BCK\)-subalgebra) \(BCK\)-(sub)algebra. (shrink)

The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK-logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK-logic with negation by a family of connectives implicitly defined by equations and compatible with BCK-congruences. Many of the logics in the current literature are natural expansions of BCK-logic with negation. The validity of (...) the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one-variable formula in the language of BCK-logic with negation. (shrink)

GE algebras (generalized exchange algebras), transitive GE algebras (tGE algebras, for short) and aGE algebras (that is, GE algebrasverifying the antisymmetry) are a generalization of Hilbert algebras. Here some properties and characterizations of these algebras are investigated. Connections between GE algebras and other classes of algebras of logic are studied. The implicative and positive implicative properties are discussed. It is shown that the class of positive implicative GE algebras (resp. the class of implicative aGE algebras) coincides with the class of (...) generalized Tarski algebras (resp. the class of Tarski algebras). It is proved that for any aGE algebra the property of implicativity is equivalent to the commutative property. Moreover, several examples to illustrate the results are given. Finally, the interrelationships between some classes of implicative and positive implicative algebras are presented. (shrink)

The logic of (commutative integral bounded) residuated lattices is known under different names in the literature: monoidal logic [26], intuitionistic logic without contraction [1], H BCK [36] (nowadays called by Ono), etc. In this paper we study the -fragment and the -fragment of the logical systems associated with residuated lattices, both from the perspective of Gentzen systems and from that of deductive systems. We stress that our notion of fragment considers the full consequence relation admitting hypotheses. It results (...) that this notion of fragment is axiomatized by the rules of the sequent calculus for the connectives involved. We also prove that these deductive systems are non-protoalgebraic, while the Gentzen systems are algebraizable with equivalent algebraic semantics the varieties of pseudocomplemented (commutative integral bounded) semilatticed and latticed monoids, respectively. All the logical systems considered are decidable. (shrink)

This paper introduces the novel concept of Neutro-BCK-algebra. In Neutro-BCK-algebra, the outcome of any given two elements under an underlying operation (neutro-sophication procedure) has three cases, such as: appurtenance, non-appurtenance, or indeterminate.

We investigate the theories of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize Frege proofs. We give sentences separating quantified versions of these theories, and define a fragment in which we can interpret a weak theory V 1 of bounded arithmetic and carry out polynomial time reasoning about matrices - for example, we can formalize the Gaussian elimination algorithm. We show that, even if we restrict our language, proves the (...) commutativity of inverses. (shrink)

Several investigations in probability theory and the theory of expert systems show that it is important to search for some reasonable generalizations of fuzzy logics (e.g. Łukasiewicz, Gödel or product logic) having a non-associative conjunction. In the present paper, we offer a non-associative fuzzy logic L CBA having as an equivalent algebraic semantics lattices with section antitone involutions satisfying the contraposition law, so-called commutative basic algebras. The class (variety) CBA of commutative basic algebras was intensively studied in several (...) recent papers and includes the class of MV-algebras. We show that the logic L CBA is very close to the Łukasiewicz one, both having the same finite models, and can be understood as its non-associative generalization. (shrink)

A classification of commutative BCK-logics which is an analogon of Hosoi classification of intermediate logics is given in the paper.

Let |$\textbf{A}$| be a |$BCK$|-algebra and |$f:A^{k}\rightarrow A$| a function. The main goal of this article is to give a necessary and sufficient condition for |$f$| to be compatible with respect to every relative congruence of |$\textbf{A}$|⁠. We extend this result in some related algebras, as e.g. in pocrims.

We introduce and discuss a concept of approximation of a topological algebraic system A by finite algebraic systems from a given class K. If A is discrete, this concept agrees with the familiar notion of a local embedding of A in a class K of algebraic systems. One characterization of this concept states that A is locally embedded in K iff it is a subsystem of an ultraproduct of systems from K. In this paper we obtain a similar characterization of (...) approximability of a locally compact system A by systems from K using the language of nonstandard analysis. In the signature of A we introduce positive bounded formulas and their approximations; these are similar to those introduced by Henson [14] for Banach space structures (see also [15, 16]). We prove that a positive bounded formula φ holds in A if and only if all precise enough approximations of φ hold in all precise enough approximations of A. We also prove that a locally compact field cannot be approximated arbitrarily closely by finite (associative) rings (even if the rings are allowed to be non-commutative). Finite approximations of the field R can be considered as possible computer systems for real arithmetic. Thus, our results show that there do not exist arbitrarily accurate computer arithmetics for the reals that are associative rings. (shrink)

The notion of positive implicative soju ideal in BCK-algebra is introduced, and several properties are investigated. Relations between soju ideal and positive implicative soju ideal are considered, and characterizations of positive implicative soju ideal are established. Finally, extension property for positive implicative soju ideal is constructed.

In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of Bellantoni–Cook's function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. In this paper we develop a semantics of SLR using BCK -algebras consisting of certain polynomial-time algorithms. It will follow from this semantics that safe recursion with arbitrary result type built up from N and (...) ⊸ as well as recursion over trees and other data structures remains within polynomial time. In its original formulation SLR supported only natural numbers and recursion on notation with first-order functional result type. (shrink)

This paper deals about dualities for bounded prelinear Hilbert algebras. In particular, we give an Esakia-style duality between the algebraic category of bounded prelinear Hilbert algebras and a category of H-spaces whose morphisms are certain continuous p-morphisms.

Using the semantic embedding technique the theorem announced by the title is proved.

We exhibit a construction which produces for every Turing machine T with two halting states μ 0 and μ -1 , an algebra B(T) (finite and of finite type) with the property that the variety generated by B(T) is residually large if T halts in state μ -1 , while if T halts in state μ 0 then this variety is residually bounded by a finite cardinal.

In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three-valued BCK-logic”. As a consequence we find an axiomatic definition of the above system.

In this work we introduce a class of commutative rings whose defining condition is that its lattice of ideals, augmented with the ideal product, the semi-ring of ideals, is isomorphic to an MV-algebra. This class of rings coincides with the class of commutative rings which are direct sums of local Artinian chain rings with unit.

The variety MBA of monadic bounded algebras consists of Boolean algebras with a distinguished element E, thought of as an existence predicate, and an operator ∃ reflecting the properties of the existential quantifier in free logic. This variety is generated by a certain class FMBA of algebras isomorphic to ones whose elements are propositional functions. We show that FMBA is characterised by the disjunction of the equations ∃E = 1 and ∃E = 0. We also define a weaker notion (...) of "relatively functional" algebra, and show that every member of MBA is isomorphic to a relatively functional one. (shrink)

Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0.1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) ∨ ((B → A) ∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MTL and Gödel logic G, and new weakening-free logics. Algebraic semantics for these logics are (...) provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0, 1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0, 1]. (shrink)

We introduce the equational notion of a monadic bounded algebra (MBA), intended to capture algebraic properties of bounded quantification. The variety of all MBA's is shown to be generated by certain algebras of two-valued propositional functions that correspond to models of monadic free logic with an existence predicate. Every MBA is a subdirect product of such functional algebras, a fact that can be seen as an algebraic counterpart to semantic completeness for monadic free logic. The analysis involves the (...) representation of MBA's as powerset algebras of certain directed graphs with a set of "marked" points. It is shown that there are only countably many varieties of MBA's, all are generated by their finite members, and all have finite equational axiomatisations classifying them into fourteen kinds of variety. The universal theory of each variety is decidable. Finitely generated MBA's are shown to be finite, with the free algebra on r generators having exactly $2^{3.2^{r.} } ^{2^{{\rm{2}}^{{\rm{r - 1}}} } } $ elements. An explicit procedure is given for constructing this freely generated algebra as the powerset algebra of a certain marked graph determined by the number r. (shrink)

We construct a sheaf-theoretic representation of quantum observables algebras over a base category equipped with a Grothendieck topology, consisting of epimorphic families of commutative observables algebras, playing the role of local arithmetics in measurement situations. This construction makes possible the adaptation of the methodology of Abstract Differential Geometry (ADG), à la Mallios, in a topos-theoretic environment, and hence, the extension of the “mechanism of differentials” in the quantum regime. The process of gluing information, within diagrams of commutative algebraic (...) localizations, generates dynamics, involving the transition from the classical to the quantum regime, formulated cohomologically in terms of a functorial quantum connection, and subsequently, detected via the associated curvature of that connection. (shrink)

We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure M. We prove that if T is a complete L-theory, then T is mutually algebraic if and only if there is some model M of T for which every atomic formula has uniformly bounded arrays. Moreover, an incomplete theory T is mutually algebraic if and only if every atomic formula has uniformly bounded arrays in every model M of T.

It is well-known that an element of a commutative ring with identity is nilpotent if, and only if, it lies in every prime ideal of the ring. A modification of this fact is amenable to a very simple proof mining analysis. We formulate a quantitative version of this modification and obtain an explicit bound. We present an application. This proof mining analysis is the leitmotif for some comments and observations on the methodology of computational extraction. In particular, we emphasize (...) that the formulation of quantitative versions of ordinary mathematical theorems is of independent interest from proof mining metatheorems. (shrink)

Abstract.ΠMTL is a schematic extension of the monoidal t-norm based logic (MTL) by the characteristic axioms of product logic. In this paper we prove that ΠMTL satisfies the standard completeness theorem. From the algebraic point of view, we show that the class of ΠMTL-algebras (bounded commutative cancellative residuated l-monoids) in the real unit interval [0,1] generates the variety of all ΠMTL-algebras.