scholarly journals Compatible Deductive Systems of Pulexes

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Shokoofeh Ghorbani
Keyword(s):  
Congruence Relation ◽  
Deductive System ◽  
Quotient Algebra ◽  
Bijective Correspondence ◽  
Deductive Systems ◽  
Congruence Relations

The notion of (compatible) deductive system of a pulex is defined and some properties of deductive systems are investigated. We also define a congruence relation on a pulex and show that there is a bijective correspondence between the compatible deductive systems and the congruence relations. We define the quotient algebra induced by a compatible deductive system and study its properties.

scholarly journals On residuated skew lattices

2019 ◽  
Vol 27 (1) ◽  
pp. 245-268
Author(s):  
Arsham Borumand Saeid ◽  
Roghayeh Koohnavard
Keyword(s):  
Congruence Relation ◽  
Residuated Lattice ◽  
Deductive System ◽  
Quotient Algebra ◽  
Skew Lattice ◽  
Skew Lattices ◽  
Green’S Relation

Abstract In this paper, we define residuated skew lattice as non-commutative generalization of residuated lattice and investigate its properties. We show that Green’s relation 𝔻 is a congruence relation on residuated skew lattice and its quotient algebra is a residuated lattice. Deductive system and skew deductive system in residuated skew lattices are defined and relationships between them are given and proved. We define branchwise residuated skew lattice and show that a conormal distributive residuated skew lattice is equivalent with a branchwise residuated skew lattice under a condition.

Fuzzy deductive systems of RM algebras

2020 ◽  
Vol 70 (6) ◽  
pp. 1259-1274
Keyword(s):  
Fuzzy Set ◽  
Complete Lattice ◽  
Deductive System ◽  
Deductive Systems

AbstractThe theory of fuzzy deductive systems in RM algebras is developed. Various characterizations of fuzzy deductive systems are given. It is proved that the set of all fuzzy deductive systems of a RM algebra 𝒜 is a complete lattice (it is distributive if 𝒜 is a pre-BBBCC algebra). Some characterizations of Noetherian RM algebras by fuzzy deductive systems are obtained. In pre-BBBZ algebras, the fuzzy deductive system generated by a fuzzy set is constructed. Finally, closed fuzzy deductive systems are defined and studied. It is showed that in finite CI and pre-BBBZ algebras, every fuzzy deductive system is closed. Moreover, the homomorphic properties of (closed) fuzzy deductive systems are provided.

Congruence relations on almost distributive lattices-II

2019 ◽  
pp. 2150005
Author(s):  
Gezahagne Mulat Addis
Keyword(s):  
Distributive Lattice ◽  
Congruence Relation ◽  
Congruence Class ◽  
Distributive Lattices ◽  
Ideal Formula ◽  
Congruence Relations

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.

Equivalence of consequence relations: an order-theoretic and categorical perspective

2009 ◽  
Vol 74 (3) ◽  
pp. 780-810 ◽  
Author(s):  
Nikolaos Galatos ◽  
Constantine Tsinakis
Keyword(s):  
Deductive System ◽  
Consequence Relations ◽  
Deductive Systems ◽  
System A ◽  
Common Character

AbstractEquivalences and translations between consequence relations abound in logic. The notion of equivalence can be denned syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [4] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3]. Other authors have extended this result to the cases of κ-deductive systems and of consequence relations on associative, commutative, multiple conclusion sequents. Our main result subsumes all existing results in the literature and reveals their common character. The proofs are of order-theoretic and categorical nature.

Anti Fuzzy Deductive Systems of BL-Algebras

2012 ◽  
Vol 3 (3) ◽  
pp. 32-40
Author(s):  
Cyrille Nganteu Tchikapa
Keyword(s):  
Deductive System ◽  
Deductive Systems

The aim of this paper is to introduce the notion of anti fuzzy (prime) deductive system in BL-algebra and to investigate their properties. It is shown that the set of all deductive systems (with the empty set) of a BL-algebra X is equipotent to a quotient of the set of all anti fuzzy deductive systems of X. The anti fuzzy prime deductive system theorem of BL-algebras is also proved.

scholarly journals Extensional quotient coalgebras

2017 ◽  
Vol 9 (2) ◽  
pp. 303-323
Author(s):  
Jean-Paul Mavoungou
Keyword(s):  
Congruence Relation ◽  
Maximal Element ◽  
Congruence Relations

Abstract Given an endofunctor F of an arbitrary category, any maximal element of the lattice of congruence relations on an F-coalgebra (A, a) is called a coatomic congruence relation on (A, a). Besides, a coatomic congruence relation K is said to be factor split if the canonical homomor-phism ν : AK → A∇A splits, where ∇A is the largest congruence relation on (A, a). Assuming that F is a covarietor which preserves regular monos, we prove under suitable assumptions on the underlying category that, every quotient coalgebra can be made extensional by taking the regular quotient of an F-coalgebra with respect to a coatomic and not factor split congruence relation or its largest congruence relation.

scholarly journals Congruence relations of Ankeny-Artin-Chowla type for pure cubic fields

1984 ◽  
Vol 96 ◽  
pp. 95-112 ◽  
Author(s):  
Hiroshi Ito
Keyword(s):  
Elliptic Curve ◽  
Class Number ◽  
Congruence Relation ◽  
Bernoulli Numbers ◽  
Quadratic Fields ◽  
Hurwitz Numbers ◽  
Real Quadratic Fields ◽  
Congruence Relations ◽  
Cubic Fields ◽  
Real Quadratic

Ankeny, Artin and Chowla [1] proved a congruence relation among the class number, the fundamental unit of real quadratic fields, and the Bernoulli numbers. Our aim of this paper is to prove similar congruence relations for pure cubic fields. For this purpose, we use the Hurwitz numbers associated with the elliptic curve defined by y2 = 4x3 — 1 instead of the Bernoulli numbers (§ 3).

Deductive systems of a cone algebra — I: Semi-ℓg-cones

2008 ◽  
Vol 58 (6) ◽  
Author(s):  
N. Subrahmanyam
Keyword(s):  
Algebra I ◽  
Deductive System ◽  
Deductive Systems ◽  
Cone Algebra ◽  
Mv Algebra

AbstractA semi-ℓg-cone is an algebra (C;*,:,·) of type (2, 2, 2) satisfying the equations (a*a)*b = b = b: (a: a); a*(b: c) = (a*b): c; a: (b*a) = (b: a)*b and (ab) *c = b* (a * c). An ℓ-group cone is a semi-ℓg-cone and a bounded semi-ℓg-cone is term equivalent to a pseudo MV-algebra. Also, a subset A of a semi-_g-cone C is an ideal of C if and only if it is a deductive system of its reduct (C;*,:).

Congruence relations, filters, ideals, and definability in lattices of α-recursively enumerable sets

1976 ◽  
Vol 41 (2) ◽  
pp. 405-418
Author(s):  
Manuel Lerman
Keyword(s):  
Congruence Relation ◽  
Lattice Theory ◽  
Elementary Theory ◽  
Finite Sets ◽  
Recursively Enumerable ◽  
Set Inclusion ◽  
Recursively Enumerable Sets ◽  
Congruence Relations ◽  
Elementary Theories

Throughout this paper, α will denote an admissible ordinal. Let (α) denote the lattice of α-r.e. sets, i.e., the lattice whose elements are the α-r.e. sets, and whose ordering is given by set inclusion. Call a set A ∈ (α)α*-finite if it is α-finite and has ordertype < α* (the Σ1-projectum of α). The α*-finite sets form an ideal of (α), and factoring (α) by this ideal, we obtain the quotient lattice *(α).We will fix a language ℒ suitable for lattice theory, and discuss decidability in terms of this language. Two approaches have succeeded in making some progress towards determining the decidability of the elementary theory of (α). Each approach was first used by Lachlan for α = ω. The first approach is to relate the decidability of the elementary theory of (α) to that of a suitable quotient lattice of (α) by a congruence relation definable in ℒ. This technique was used by Lachlan [4, §1] to obtain the equidecidability of the elementary theories of (ω) and *(ω), and was generalized by us [6, Corollary 1.2] to yield the equidecidability of the elementary theories of (α) and *(α) for all α. Lachlan [3] then adopted a different approach.

scholarly journals Rough sets based on fuzzy ideals in distributive lattices

2020 ◽  
Vol 18 (1) ◽  
pp. 122-137
Author(s):  
Yongwei Yang ◽  
Kuanyun Zhu ◽  
Xiaolong Xin
Keyword(s):  
Distributive Lattice ◽  
Rough Set ◽  
Rough Sets ◽  
Congruence Relation ◽  
Distributive Lattices ◽  
Model Based ◽  
Congruence Relations ◽  
Fuzzy Ideal ◽  
Lower And Upper Approximations ◽  
Generalized Rough Sets

Abstract In this paper, we present a rough set model based on fuzzy ideals of distributive lattices. In fact, we consider a distributive lattice as a universal set and we apply the concept of a fuzzy ideal for definitions of the lower and upper approximations in a distributive lattice. A novel congruence relation induced by a fuzzy ideal of a distributive lattice is introduced. Moreover, we study the special properties of rough sets which can be constructed by means of the congruence relations determined by fuzzy ideals in distributive lattices. Finally, the properties of the generalized rough sets with respect to fuzzy ideals in distributive lattices are also investigated.

Sign in / Sign up

Export Citation Format

Share Document