loading...
Semirigid Equivalence Relations on a Finite Set
May 22-May 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2008.4738th International Symposium on Multi ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi, "Semirigid Equivalence Relations on a Finite Set," Multiple-Valued Logic, IEEE International Symposium on, pp. 118-123, 38th International Symposium on Multiple Valued Logic (ismvl 2008), 2008.
 
 
BibTex
x
 
@article{ 10.1109/ISMVL.2008.47,
author = {Masahiro Miyakawa and Maurice Pouzet and Ivo G. Rosenberg and Hisayuki Tatsumi},
title = {Semirigid Equivalence Relations on a Finite Set},
journal ={Multiple-Valued Logic, IEEE International Symposium on},
volume = {0},
year = {2008},
issn = {0195-623X},
pages = {118-123},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2008.47},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Multiple-Valued Logic, IEEE International Symposium on
TI - Semirigid Equivalence Relations on a Finite Set
SN - 0195-623X
SP118
EP123
A1 - Masahiro Miyakawa,
A1 - Maurice Pouzet,
A1 - Ivo G. Rosenberg,
A1 - Hisayuki Tatsumi,
PY - 2008
KW - clone
KW - semirigid
KW - equivalence relation
KW - lattice
KW - universal algebra
VL - 0
JA - Multiple-Valued Logic, IEEE International Symposium on
ER -
 
A system $R$ of equivalence relations on a set $A$ (with at least $3$ elements) is \emph{semirigid} if??only the trivial operations??(that is the projections and constant functions) preserve all members of $R$. To a system $R$ of equivalence relations we associate a graph $G_R$. We observe that??if $R$ is semirigid then the graph $G_R$ is $2$-connected. We show that the converse holds if all the members of $R$ are atoms of the lattice $E$ of equivalence relations on $A$. We present a notion of??graphical composition of semirigid systems and show that it preserves semirigidity.
Index Terms:
clone, semirigid, equivalence relation, lattice, universal algebra
Citation:
Masahiro Miyakawa, Maurice Pouzet, Ivo G. Rosenberg, Hisayuki Tatsumi, "Semirigid Equivalence Relations on a Finite Set," ismvl, pp.118-123, 38th International Symposium on Multiple Valued Logic (ismvl 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.