scholarly journals Norms over intuitionistic fuzzy congruence relations on rings

2021 ◽  
Vol 27 (3) ◽  
pp. 51-68
Author(s):  
Rasul Rasuli ◽  
Keyword(s):  
Equivalence Relation ◽  
Congruence Relation ◽  
Equivalence Relations ◽  
Intuitionistic Fuzzy ◽  
Congruence Relations ◽  
Fuzzy Congruence

In this paper, by using norms, we define the concept of intuitionistic fuzzy equivalence relations and intuitionistic fuzzy congruence relations on ring R and we investigate some assertions. Also we define intuitionistic fuzzy ideals of ring R under norms and compare this with fuzzy equivalence relation and fuzzy congruence relation on ring R such that we define new introduced ring.

scholarly journals Anti Fuzzy Equivalence Relation on Rings with Respect to t-conorm C

2019 ◽  
pp. 1-19 ◽  
Author(s):  
Rasul Rasuli
Keyword(s):  
Equivalence Relation ◽  
Congruence Relation ◽  
Basic Properties ◽  
Fuzzy Congruence

In this paper, by using t-conorms, we define the concept of anti fuzzy equivalence relation and anti fuzzy congruence relation on ring R and we investigate some of their basic properties. Also we define fuzzy ideals of ring R under t-conorms and compare this with fuzzy equivalence relation and fuzzy congruence relation on ring R such that we define new introduced ring. Next we investigate this concept under homomorphism of new introduced ring.

scholarly journals Fuzzy Congruence Relations in Generalized Almost Distributive Fuzzy Lattices

2021 ◽  
Vol 2089 (1) ◽  
pp. 012067
Author(s):  
T. Sangeetha ◽  
S. Senthamil Selvi
Keyword(s):  
Prime Ideal ◽  
Congruence Relation ◽  
Subject Classification ◽  
Ams Subject Classification ◽  
Congruence Relations ◽  
Fuzzy Congruence

Abstract This paper defines the fuzzy congruence relation of GADFL (Generalized nearly distributive fuzzy lattices). The ideas of θ - ideal and θ - Prime ideal are introduced in GADFL, and the fuzzy congruence relation is used to explain these ideals. AMS subject classification: 06D72, 06F15, 08A72.

Congruence relations on lattices of recursively enumerable sets

2002 ◽  
Vol 67 (2) ◽  
pp. 497-504
Author(s):  
Todd Hammond
Keyword(s):  
Computational Complexity ◽  
Equivalence Class ◽  
Equivalence Relation ◽  
Congruence Relation ◽  
Equivalence Classes ◽  
Complexity Classes ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets ◽  
Congruence Relations ◽  
Standard Enumeration

Let {We}e∈ω be a standard enumeration of the recursively enumerable (r. e.) subsets of ω = {0, 1, 2, …}. The lattice of recursively enumerable sets, is the structure ({We}e∈ω, ∪, ∩). is the sublattice of consisting of the recursive sets.Suppose is a lattice of subsets of ω. ≡ is said to be a congruence relation on if ≡ is an equivalence relation on and if for all U, U′ ∈ and V, V ∈ , if U ≡ U′ and V ≡ V′ then U ∪ U′ ≡ V ∪ V′ and U ∩ U′ ≡ V ∩ V′. [U] = {V ∈ | V ≡ U} is the equivalence class of U. If ≡ is a congruence relation on , the elements of the quotient lattice / ≡ are the equivalence classes of ≡. [U] ∪ [V] is defined as [U ∪ V], and [U] ∩ [V] is defined as [U ∩ V].The quotient lattices of (or of some sublattice ) correspond naturally with the congruence relations which give rise to them, and in turn the congruence relations of sublattices of can be characterized in part by their computational complexity. The aim of the present paper is to characterize congruence relations in some of the most important complexity classes.

Fundamental relations and identities of fuzzy hyperalgebras

2021 ◽  
pp. 1-10
Author(s):  
Narjes Firouzkouhi ◽  
Abbas Amini ◽  
Chun Cheng ◽  
Mehdi Soleymani ◽  
Bijan Davvaz
Keyword(s):  
Universal Algebra ◽  
Equivalence Relation ◽  
Polynomial Function ◽  
Equivalence Relations ◽  
Fundamental Relation ◽  
Term Function ◽  
Biological Phenomena ◽  
Definition Of

Inspired by fuzzy hyperalgebras and fuzzy polynomial function (term function), some homomorphism properties of fundamental relation on fuzzy hyperalgebras are conveyed. The obtained relations of fuzzy hyperalgebra are utilized for certain applications, i.e., biological phenomena and genetics along with some elucidatory examples presenting various aspects of fuzzy hyperalgebras. Then, by considering the definition of identities (weak and strong) as a class of fuzzy polynomial function, the smallest equivalence relation (fundamental relation) is obtained which is an important tool for fuzzy hyperalgebraic systems. Through the characterization of these equivalence relations of a fuzzy hyperalgebra, we assign the smallest equivalence relation α i 1 i 2 ∗ on a fuzzy hyperalgebra via identities where the factor hyperalgebra is a universal algebra. We extend and improve the identities on fuzzy hyperalgebras and characterize the smallest equivalence relation α J ∗ on the set of strong identities.

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.

scholarly journals The absorption theorem for affable equivalence relations

2008 ◽  
Vol 28 (5) ◽  
pp. 1509-1531 ◽  
Author(s):  
THIERRY GIORDANO ◽  
HIROKI MATUI ◽  
IAN F. PUTNAM ◽  
CHRISTIAN F. SKAU
Keyword(s):  
Dynamical Systems ◽  
Equivalence Relation ◽  
Closed Subset ◽  
Cantor Set ◽  
Equivalence Relations ◽  
Orbit Structure ◽  
Orbit Equivalent ◽  
Finite Set ◽  
Significant Generalization

AbstractWe prove a result about extension of a minimal AF-equivalence relation R on the Cantor set X, the extension being ‘small’ in the sense that we modify R on a thin closed subset Y of X. We show that the resulting extended equivalence relation S is orbit equivalent to the original R, and so, in particular, S is affable. Even in the simplest case—when Y is a finite set—this result is highly non-trivial. The result itself—called the absorption theorem—is a powerful and crucial tool for the study of the orbit structure of minimal ℤn-actions on the Cantor set, see Remark 4.8. The absorption theorem is a significant generalization of the main theorem proved in Giordano et al [Affable equivalence relations and orbit structure of Cantor dynamical systems. Ergod. Th. & Dynam. Sys.24 (2004), 441–475] . However, we shall need a few key results from the above paper in order to prove the absorption theorem.

On Constructing Ergodic Hyperfinite Equivalence Relations of Non-Product Type

2013 ◽  
Vol 56 (1) ◽  
pp. 136-147
Author(s):  
Radu-Bogdan Munteanu
Keyword(s):  
Equivalence Relation ◽  
Product Type ◽  
Bratteli Diagram ◽  
Equivalence Relations ◽  
Orbit Equivalence ◽  
Property A

AbstractProduct type equivalence relations are hyperfinitemeasured equivalence relations, which, up to orbit equivalence, are generated by product type odometer actions. We give a concrete example of a hyperfinite equivalence relation of non-product type, which is the tail equivalence on a Bratteli diagram. In order to show that the equivalence relation constructed is not of product type we will use a criterion called property A. This property, introduced by Krieger for non-singular transformations, is defined directly for hyperfinite equivalence relations in this paper.

Fuzzy congruence relation generated by a fuzzy relation in vector spaces

2018 ◽  
Vol 35 (5) ◽  
pp. 5635-5645
Author(s):  
S. Khosravi Shoar ◽  
R.A. Borzooei ◽  
R. Moradian
Keyword(s):  
Congruence Relation ◽  
Fuzzy Relation ◽  
Vector Spaces ◽  
Fuzzy Congruence

scholarly journals A Class of Homomorphism Theories for Groupoids

1964 ◽  
Vol 14 (2) ◽  
pp. 129-135 ◽  
Author(s):  
Gerald Losey
Keyword(s):  
Zero Element ◽  
Equivalence Relations ◽  
Canonical Homomorphism ◽  
Normal Subgroups ◽  
Algebraic Systems ◽  
Congruence Relations ◽  
Unique Homomorphism ◽  
Factor System ◽  
Object Relative

In a well-behaved homomorphism theory for a class of algebraic systems certain “closed objects” relative to a given G ∈ are distinguished which act as kernels of homomorphisms. For example, if is the class of groups then the closed objects relative to a given group G are the normal subgroups of G; if is the class of semigroups with zero element then one can devise a homomorphism theory in which the closed objects relative to a given S ∈ are the ideals of S[cf. Rees (3)]; in the class of groupoids one may define the closed objects relative to a given groupoid G to be the congruence relations on G, that is, subsets π⊆G×G which are equivalence relations having the property that (x1y1, x2y2) ∈ π whenever (x1, x2), (y1, y2) ∈ π. Given such a closed object N relative to G there exists a “factor” system G/N and a (canonical) homomorphism η: G→G/N characterised by the property: If σ G→H is a homomorphism with kernel N then there is a unique homomorphism : G/N→H such that . η = σ and the kernel of is trivial in the sense that the kernel of is the unique smallest closed object relative to G/N.

An axiomatization of the logic with the rough quantifier

1991 ◽  
Vol 56 (2) ◽  
pp. 608-617 ◽  
Author(s):  
Michał Krynicki ◽  
Hans-Peter Tuschik
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Order Structure ◽  
Partition Model ◽  
Weak Model ◽  
First Order ◽  
Basic Properties ◽  
Generalized Quantifier ◽  
Order Language ◽  
The Right

We consider the language L(Q), where L is a countable first-order language and Q is an additional generalized quantifier. A weak model for L(Q) is a pair 〈, q〉 where is a first-order structure for L and q is a family of subsets of its universe. In case that q is the set of classes of some equivalence relation the weak model 〈, q〉 is called a partition model. The interpretation of Q in partition models was studied by Szczerba [3], who was inspired by Pawlak's paper [2]. The corresponding set of tautologies in L(Q) is called rough logic. In the following we will give a set of axioms of rough logic and prove its completeness. Rough logic is designed for creating partition models.The partition models are the weak models arising from equivalence relations. For the basic properties of the logic of weak models the reader is referred to Keisler's paper [1]. In a weak model 〈, q〉 the formulas of L(Q) are interpreted as usual with the additional clause for the quantifier Q: 〈, q〉 ⊨ Qx φ(x) iff there is some X ∊ q such that 〈, q〉 ⊨ φ(a) for all a ∊ X.In case X satisfies the right side of the above equivalence we say that X is contained in φ(x) or, equivalently, φ(x) contains X.

Sign in / Sign up

Export Citation Format

Share Document