\documentclass[11pt,twoside]{article} \usepackage{amsmath, amsthm, amscd, amsfonts, amssymb, graphicx, color} \usepackage[bookmarksnumbered, colorlinks]{hyperref} \usepackage{float} \usepackage{lipsum} \usepackage{afterpage} \usepackage[labelfont=bf]{caption} \usepackage[nottoc,notlof,notlot]{tocbibind} %\renewcommand\bibname{References} \def\bibname{\Large \bf References} \usepackage{lipsum} \usepackage{fancyhdr} \pagestyle{fancy} \fancyhf{} \renewcommand{\headrulewidth}{0pt} \fancyhead[LE,RO]{\thepage} \thispagestyle{empty} %\afterpage{\lhead{new value}} \fancyhead[CE]{A. Borumand Saeid and N. Shojaei} \fancyhead[CO]{Some Results On Pseudo CI-Filters} %\topmargin=-1.6cm \textheight 17.5cm% \textwidth 12cm % \topmargin 8mm % \oddsidemargin 20mm % \evensidemargin 20mm % \footskip=24pt % \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{example}[theorem]{Example} \newtheorem{xca}[theorem]{Exercise} %\theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \renewenvironment{proof}{{\bfseries \noindent Proof.}}{~~~~$\square$} \makeatletter \def\th@newremark{\th@remark\thm@headfont{\bfseries}} \makeatletter %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % If you want to insert other packages. Insert them here %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %\long\def\symbolfootnote[#1]#2{\begingroup% %\def\thefootnote{\fnsymbol{footnote}}\footnote[#1]{#2}\endgroup} \def \thesection{\arabic{section}} \begin{document} %\baselineskip 9mm %\setcounter{page}{} \thispagestyle{plain} {\noindent Journal of Mathematical Extension \\ Journal Pre-proof}\\ ISSN: 1735-8299\\ URL: http://www.ijmex.com\\ \begin{center} {\Large \bf Some Results On Pseudo CI-Filters\\} \let\thefootnote\relax\footnote{\scriptsize Received: July 2020; Accepted: March 2021} {\bf Arsham Borumand Saeid}\vspace*{-2mm}\\ \vspace{2mm} {\small Shahid Bahonar University of Kerman } \vspace{2mm} {\bf Neda Shojaei$^*$\let\thefootnote\relax\footnote{$^*$Corresponding Author}}\vspace*{-2mm}\\ \vspace{2mm} {\small Kerman Branch, Islamic Azad University} \vspace{2mm} \end{center} \vspace{4mm} {\footnotesize \begin{quotation} {\noindent \bf Abstract.} The aim of this paper is to introduce the notion of pseudo CI-filter in the pseudo CI-algebra and defined of congruence relation, transitive CI-algebra and pseudo CI-filters generated by a set. The Maximal pseudo-filter, prime pseudo CI-filter and closed pseudo CI-filter are defined, and we show that each Maximal pseudo CI-filter is a prime pseudo CI-filter. With an example, it shows that the inverse is not true. Define of homomorphism on CI-algebras is another aim of this article, and proves that every homomorphic image and preimage of a pseudo CI-filter is also a pseudo CI-filter. Furthermore, there are some relations between prime pseudo CI-filters, Maximal pseudo CI-filters and generated pseudo CI-filters. The notion of congruence relations on pseudo CI-algebras is one of the purposes of this article. There are some relations between pseudo CI-filters and pseudo congruence. Also, the transitive CI-algebra and generated pseudo CI-filter are introduced. \end{quotation} \begin{quotation} \noindent{\bf AMS Subject Classification:} {06F35, 03G25, 03B52, 08A72.} \noindent{\bf Keywords and Phrases:}Pseudo CI-algebra, pseudo CI-filter, congruence relation, transitive CI-algebra. \end{quotation}} \section{Introduction} \label{intro} % It is advised to give each section and subsection a unique label. In 1966, Y. Imai and K. Is\'{e}ki \cite{Imai} introduced the notion of a BCK-algebra. There exist several generalizations of BCK-algebras such as BCI-algebras \cite{Iski}, BCH-algebras \cite{Hu}, BE-algebras \cite{Kim}, and CI-algebras \cite{Meng}. J. Neggers, S. S. Ahn and H. S. Kim \cite{Neggers} introduced a new notion, called Q-algebra, which is a generalization of BCH, BCI, BCK-algebra, and generalized some theorems discussed in a BCI-algebra. D. Mundici \cite{Mundici} proved MV-algebras are categorically equivalent to bounded commutative BCK-algebra, and proved that implicative commutative semigroups are equivalent to a class of BCK-algebras. The notion of BE-algebras was introduced by Kim and Kim \cite{Kim}. Beside, BE-algebras were deeply studied by Ahn and So \cite{Ahn}, Ahn et al. \cite{Kim}, Walendziak \cite{Walendzias}. Also, Meng \cite{Meng} gave a procedure to generate a filter by a subset in a transitive BE-algebra and gave some characterizations of Noetherian and Artinian BE-algebras. Meng \cite{Meng} introduced the notion of CI-algebras as a generalization of BE-algebras and dual BCK/BCI/BCH algebras and proved that in transitive BE-algebras, the notion of ideals is equivalent to one of filters. Furthermore, he discussed on relations between singular CI-algebras and Abelian groups \cite{LMeng, Meng}. Y. B. Jun, H.S. Kim, J. Neggers \cite{Jun} introduced the notion of a pseudo d-algebra as a generalization of the idea of a d-algebra. In $2001$, G. Georgescu and A. Iorgulescu \cite{Georgescu} introduced pseudo BCK-algebras as an extension of BCK-algebras. In $2008$, W. A. Dudek and Y. B. Jun \cite{Dudek} defined pseudo BCI-algebras as a natural generalization of BCI-algebras and of pseudo BCI-algebras. G. Dymek studied p-semisimple pseudo BCI-algebras and periodic pseudo BCI-algebras \cite{Dymak}. R. A. Borzooei et al. \cite{Borzooei} defined pseudo BE-algebras which are a generalization of BE-algebras. A. Walendziak introduced pseudo BCH-algebras and then investigated ideals in such algebras \cite{Walendziak}. Borumand et al. \cite{Borumand, Borzooei} introduced the notion of pseudo BE-algebras and defined distributive pseudo BE-algebras. Then, congruence relations to pseudo BE-algebras are studied in Rezaei and Borumand. et al. \cite{Radfar}. Recently, A. borumand. et.al. defined the class of pseudo CI-algebras and studied some of its subclasses \cite{Rezaei}.\\ In this paper, we introduce the notion of pseudo CI-filter in a pseudo CI-algebra. Some proposition equivalent to the definition of CI-filter were proved. The maximal pseudo CI-filter, prime pseudo CI-filter and closed pseudo CI-filter are defined and showed that each maximal pseudo CI-filter is a prime pseudo CI-filter and with an example it is shown that it conversely is not true. We introduce generated pseudo CI-filter and in a transitive CI-algebra and show that for every set A of X, the generated pseudo CI-filter (A] is equal to $ \{x\in X: \prod\limits_{i=1}^n (a_{i} \rightarrow x)=1, \exists a_{1},···,a_{n}\in A\}$. Also introduce a transitive CI-algebra is the purposes of this article. Furthermore, there are some relations between prime pseudo CI-filters Maximal pseudo CI-filters and generated pseudo CI-filters. Homomorphism between two pseudo CI-algebra is introduce and it is prove that every homomorphic image (under certain conditions) and preimage of a pseudo CI-filter is also a pseudo CI-filter. $A(x, y)$ as pseudo upper set of $x$ and $y$ is introduce and its relationship with the pseudo CI-filter is checked, and proved that every pseudo CI-filter is an union of pseudo upper sets.\\ The definition of congruence relations on pseudo CI-algebras is the another aim of this paper. There are some relations between pseudo CI-filters and congruence relation. In a transitive CI-algebra we created a congruence relation by a pseudo CI-filters, and apply the notion of congruence relations to pseudo CI– algebras and discuss on the quotient algebras via this congruence relations. With a congruence relation $\theta $ on a pseudo CI-algebra, the quotient set $X/\theta$ is defined and with two operation $\rightarrow$ and $\rightsquigarrow$, a pseudo CI-algebra is obtained. \section{Preliminaries} \label{sec:2} \begin{definition}\label{2.1} (See \cite{Neggers}){\it A Q-algebra is a nonempty set $X$ with a constant $0$ and a binary operation $ " \ast " $ satisfying axioms: $(i)$ $x\ast x = 0$, $(ii)$ $x\ast 0 = x$, $(iii)$ $(x\ast y)\ast z = (x\ast z)\ast y$ for all $x,y,z \in X$. (See \cite{LMeng}) An algebra $X = (X;\rightarrow,1)$ of type $(2,0)$ is called CI-algebra (dual Q-algebra), if for all $x,y,z\in X$, it satisfies the following axioms: $(CI1)$ $x\rightarrow x=1$, $(CI2)$ $1\rightarrow x=x$, $(CI3)$ $x\rightarrow (y\rightarrow z)=y\rightarrow(x\rightarrow z)$. \vspace{5pt} The relation "$\leq$" on $X$ define by, $x \leq y$ if and only if $x\rightarrow y=1$.} \end{definition} \begin{definition}\label{2.2} (See \cite{Neggers}){\it An algebra $X=(X; \ast ,\diamond , 0)$ of type $(2, 2, 0)$ is called pseudo Q-algebra if, for all $x,y,z \in X$, it satisfies the following axioms: (psQ1) $x\ast x=x\diamond x= 0$, (psQ2) $x\ast 0=x\diamond 0=x$, (psQ3) $(x\ast y)\diamond z=(x\diamond z)\ast y$.} \end{definition} \begin{example}\label{2.3} See \cite{Neggers} Let $X=\{0,a,b,c\}$ be a set. Define the operations $\ast $ and $\diamond $ on $X$ by the following tables: \vspace{3pt} \begin{center} \begin{tabular}{p{9pt}|p{8pt} p{4pt} p{4pt} p{4pt}} \parbox{9pt}{\raggedright $\ast $ } & \parbox{8pt}{\raggedright $0$ } & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} \\ \hline \parbox{9pt}{\raggedright $0$} & \parbox{8pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \\ \parbox{9pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \\ \parbox{9pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $c$} \\ \parbox{9pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \\ \end{tabular} \qquad\;\;\;\;\;\;\;\; \vspace{5pt} \begin{tabular}{p{9pt}|p{8pt} p{4pt} p{4pt} p{4pt}} \parbox{9pt}{\raggedright $\diamond $ } & \parbox{8pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} \\ \hline \parbox{9pt}{\raggedright $0$} & \parbox{8pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \\ \parbox{9pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \\ \parbox{9pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $c$} \\ \parbox{9pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $0$} & \parbox{4pt}{\raggedright $0$} \end{tabular} \end{center} \vspace{3pt} Then $(X;\ast ,\diamond ,0)$ is a pseudo Q-algebra. \end{example} \begin{definition}\label{2.4} (see \cite{Bee}) {\it An algebra $(X;\rightarrow,\rightsquigarrow,1)$ of type $(2,2,0)$ is called dual pseudo Q-algebra if, for all $x,y,z\in X$, it satisfies the following axioms: (dpsQ1) $x\rightarrow x=x\rightsquigarrow x=1$, (dpsQ2) $1\rightarrow x=1\rightsquigarrow x=x$, (dpsQ3) $x\rightarrow(y\rightsquigarrow z)=y\rightsquigarrow (x\rightarrow z)$. \vspace{2pt} A dual pseudo Q-algebra $X$ is called a pseudo CI-algebra, if it satisfies the following condition:\\ \vspace{2pt} (psCI4) $x\rightarrow y=1\Leftrightarrow x\rightsquigarrow y=1$.\\ \vspace{2pt} In a pseudo CI-algebra, we introduce a binary relation "$\leq$" by: \begin{center} $x\leq y\Leftrightarrow x\rightarrow y = 1\Leftrightarrow x\rightsquigarrow y = 1$, for all $x,y\in X$. \end{center}} \end{definition} \begin{example}\label{2.5} (See\cite{Bee}) Let $X=\{1,a,b,c\}$ be a set. Define the operations $\rightarrow$ and $\rightsquigarrow$ on $X$ by the following tables: \vspace{2pt} \begin{center} \begin{tabular}{p{9pt}|p{8pt} p{4pt} p{4pt} p{4pt}} \parbox{9pt}{ $\rightarrow$ } & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{$a$} & \parbox{4pt}{b} & \parbox{4pt}{$c$} \\ \hline \parbox{9pt}{\raggedright 1} & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} \\ \parbox{9pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $a$} \\ \parbox{9pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$} \\ \parbox{9pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $1$} \\ \end{tabular} \qquad\;\;\;\;\;\;\;\;\; \vspace{10pt} \begin{tabular}{p{9pt}|p{8pt} p{4pt} p{4pt} p{4pt}} \parbox{9pt}{\raggedright $\rightsquigarrow$ } & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright$c$} \\ \hline \parbox{9pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} \\ \parbox{9pt}{\raggedright $a$}& \parbox{4pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} \\ \parbox{9pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} \\ \parbox{9pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $c$ } & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} \\ \end{tabular} \end{center} \vspace{2pt} Then $X=(X;\rightarrow ,\rightsquigarrow ,1)$ is a dual pseudo Q-algebra which is not a pseudo CI-algebra, because $b\rightarrow c=1$ but $b\rightsquigarrow c= c\neq 1$. \end{example} A pseudo CI-algebra $(X;\rightarrow ,\rightsquigarrow ,1)$ is said to be a pseudo BE-algebra, if for all $x\in X$; \begin{equation}\nonumber x\rightarrow 1 =x\rightsquigarrow 1=1. \end{equation} \vspace{2pt} {\it So,(See \cite{Rezaei}) an algebra $X=(X;\rightarrow , \rightsquigarrow , 1)$ of type $(2; 2; 0)$ is a $\bf pseudo \; CI-algebra$ if it satisfies; $(pCI1)$ $x\rightarrow x = x\rightsquigarrow x = 1$, $(pCI2)$ $1\rightarrow x = 1\rightsquigarrow x =x $, $(pCI3)$ $x\rightarrow (y\rightsquigarrow z) = y\rightsquigarrow (x\rightarrow z)$, $(pCI4)$ $x\rightarrow y = 1 \Leftrightarrow x\rightsquigarrow y = 1$.} \vspace{2pt} If $(X;\rightarrow,\rightsquigarrow, 1)$ is a pseudo CI-algebra satisfying $x\rightarrow y = x\rightsquigarrow y$; for all $x, y\in X$, then $(X;\rightarrow,\rightsquigarrow, 1)$ is a CI-algebra. \begin{definition}\label{2.6} (See \cite{Rezaei}) {\it Let $a$ be an element of a pseudo CI-algebra $X=(X;\rightarrow ,\rightsquigarrow ,1)$. An element $a$ is said to be an atom in $X$ if for any $x\in X$, $a\rightarrow x=1$ (or $a\rightsquigarrow x =1 $) implies $a=x$.} \end{definition} \begin{example}\label{2.7} Let $X=\{1,a,b,c,d\}$. Define the operations $\rightarrow$ and $\rightsquigarrow$ on $X$ by the following tables: \begin{center} \vspace{4pt} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt}} \parbox{6pt}{\raggedright $\rightarrow$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} \\ \hline \parbox{6pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$ } & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$ } & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $1$} \\ \parbox{6pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $1$}\\ \end{tabular} \qquad\;\;\;\;\;\;\;\;\; \vspace{10pt} \begin{tabular}{p{6pt}|p{4pt} p{4pt} p{4pt} p{4pt}p{8pt}} \parbox{6pt}{\raggedright $\rightsquigarrow$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} \\ \hline \parbox{6pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$}\\ \parbox{6pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $1$} \\ \parbox{6pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $1$}& \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $1$}\\ \end{tabular} \vspace{4pt} \end{center} Then $X$ is a pseudo CI-algebra. \end{example} \begin{proposition}\label{2.8} (See \cite{Rezaei}) {\it If $X=(X;\rightarrow ,\rightsquigarrow ,1)$ is a pseudo CI-algebra, then for all $x, y, z\in X$, we have: (1) $x\leq (x\rightarrow y)\rightsquigarrow y$, $ \ \ x\leq (x\rightsquigarrow y)\rightarrow y$, (2) $x\leq y\rightarrow z \Leftrightarrow y\leq x\rightsquigarrow z$, (3) $(x\rightarrow y)\rightarrow 1 =(x\rightarrow 1)\rightsquigarrow (y\rightsquigarrow 1)$, $ \ \ (x\rightsquigarrow y)\rightsquigarrow 1 =(x\rightsquigarrow 1)\rightarrow(y\rightarrow 1)$, (4) $x\rightarrow 1=x\rightsquigarrow 1$, (5) $x\leq y$ implies $x\rightarrow 1=y\rightarrow 1$.} \end{proposition} \begin{proposition}\label{2.9} {\it In a pseudo CI-algebra $X$, for all $x,y\in X$, the following holds: $(1)$ If $y\leq 1$ then $x \rightarrow (y \rightsquigarrow x) = 1 \ $ and $ \ x\rightsquigarrow (y\rightarrow x) = 1$, $(2)$ If $y\leq 1$ then $x\rightsquigarrow(y \rightsquigarrow x) = 1 \ $ and $ \ x\rightarrow (y \rightarrow x) = 1$, $(3)$ $x\rightsquigarrow ((x\rightsquigarrow y)\rightarrow y) = 1 \ $ and $ \ x\rightarrow ((x\rightarrow y)\rightsquigarrow y) = 1$, $(4)$ $(x\rightarrow 1)\rightarrow 1 =(x\rightarrow 1)\rightsquigarrow 1 \ $ and $ \ (x\rightsquigarrow 1)\rightsquigarrow 1 =(x\rightsquigarrow 1)\rightarrow 1$.} \begin{proof} $(1)$ Let $x,y\in X$. By (pCI3), (pCI1), (pCI2) and $y\leq 1$ we have; \begin{equation}\nonumber x\rightarrow (y\rightsquigarrow x)=y\rightsquigarrow (x\rightarrow x)=y\rightsquigarrow 1=1, \end{equation} and by similar way, we have; \begin{equation}\nonumber x\rightsquigarrow (y\rightarrow x) = y\rightarrow (x\rightsquigarrow x)=y\rightarrow 1 = 1. \end{equation} $(2)$ By (psCI4) and (1) the proof is clear. $(3)$ Let $x,y\in X$. By (pCI3) and (pCI1) we have; \begin{equation}\nonumber x \rightsquigarrow ((x\rightsquigarrow y)\rightarrow y)=(x\rightsquigarrow y)\rightarrow (x\rightsquigarrow y)=1, \end{equation} and \begin{equation}\nonumber x\rightarrow ((x\rightarrow y)\rightsquigarrow y)=(x\rightarrow y)\rightsquigarrow (x\rightarrow y)=1. \end{equation} $(4)$ By Proposition \eqref{2.8},(3) and $(pCI1)$, \begin{equation}\nonumber (x\rightarrow 1)\rightarrow 1 =(x\rightarrow 1)\rightsquigarrow (1 \rightsquigarrow 1)=(x\rightarrow 1)\rightsquigarrow 1 , \end{equation} and \begin{equation}\nonumber (x\rightsquigarrow 1)\rightsquigarrow 1 =(x\rightsquigarrow 1)\rightarrow(1 \rightarrow 1)=(x\rightsquigarrow 1)\rightarrow 1. \end{equation} \end{proof} \end{proposition} \begin{example}\label{2.10} \cite{Rezaei} Let $X= \ \{1, a, b, c, d, e\}$. Define the operations $\rightarrow$ and $\rightsquigarrow$ on $X$ by the following tables: \begin{center} \vspace{5pt} \begin{tabular}{p{6pt}|p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} \parbox{6pt}{\raggedright $\rightarrow$ } & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $e$} \\ \hline \parbox{6pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $e$} \\ \parbox{6pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $e$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $e$} & \parbox{8pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $c$} \\ \parbox{6pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $a$} \\ \parbox{6pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $b$} \\ \parbox{6pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $1$} \\ \end{tabular} \qquad\;\;\;\;\;\;\;\;\; \begin{tabular}{p{6pt}|p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} \parbox{6pt}{\raggedright $\rightsquigarrow$ } & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $e$} \\ \hline \parbox{6pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $e$} \\ \parbox{6pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $e$} & \parbox{8pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $c$} \\ \parbox{6pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $1$} & \parbox{4pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $e$} & \parbox{8pt}{\raggedright $d$} \\ \parbox{6pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $a$} & \parbox{4pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $c$} & \parbox{8pt}{\raggedright $b$} \\ \parbox{6pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $b$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $d$} & \parbox{8pt}{\raggedright $1$} & \parbox{8pt}{\raggedright $a$} \\ \parbox{6pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $e$} & \parbox{4pt}{\raggedright $d$} & \parbox{4pt}{\raggedright $c$} & \parbox{4pt}{\raggedright $b$} & \parbox{8pt}{\raggedright $a$} & \parbox{8pt}{\raggedright $1$} \\ \end{tabular} \vspace{5pt} \end{center} Then $X=(X;\rightarrow ,\rightsquigarrow ,1)$ is a pseudo CI-algebra which is not a pseudo BE-algebra. Because $a\rightarrow 1=a\neq 1$ and $a\rightsquigarrow 1=a\neq 1$. \end{example} \begin{proposition}\label{2.11} {\it If $X$ be a pseudo CI-algebra and $b,c\in X$ such that $b\rightarrow a=c\rightarrow a$ and $b\rightsquigarrow a=c\rightsquigarrow a$ for some $a \in X$ then; \begin{center} $b\rightarrow 1=c\rightarrow 1$ and $b\rightsquigarrow 1=c\rightsquigarrow 1$. \end{center}} \begin{proof} By (pCI3) and (pCI1) for any $a,b,c\in X$, we have; \begin{center} $b\rightarrow 1=b\rightarrow(a\rightsquigarrow a)=a\rightsquigarrow (b\rightarrow a)=a\rightsquigarrow(c\rightarrow a)=c\rightarrow(a\rightsquigarrow a)=c\rightarrow 1.$ \end{center} This complete the proof. \end{proof} \end{proposition} \begin{proposition}\label{2.12} (See \cite{Rezaei}) {\it Let $(X; \rightarrow,\rightsquigarrow , 1)$ be a pseudo CI-algebra. If $a, b \in X$ are atoms in $X$, then the following are true:\\ $ \ \ (1) \ $ $a=(a\rightarrow 1)\rightarrow 1$, \\ $ \ \ (2) \ $ For any $x \in X \ $, $(a\rightarrow x) \rightsquigarrow x = a \ $, $ \ \ (a\rightsquigarrow x)\rightarrow x = a$,\\ $ \ \ (3) \ $ For any $x \in X$, $(a\rightarrow x) \rightsquigarrow 1 =\ x \rightarrow a \ $, $ \ \ (a\rightsquigarrow x)\rightarrow 1 = x\ \rightsquigarrow a $,\\ $ \ \ (4) \ $ For any $x \in X$, $x\rightarrow a = (a\rightarrow 1)\rightsquigarrow (x\rightarrow 1) \ $, $ \ \ x\rightsquigarrow a = (a\rightsquigarrow 1)\rightarrow (x \rightsquigarrow 1)$.} \end{proposition} \begin{example}\label{2.13} Let $(G, \cdot)$ be a group with identity element $e$. Define the operations $\rightarrow$ and $\rightsquigarrow$ on $G$ by, $a\rightarrow b= a^{-1}b$ and $a\rightsquigarrow b= ba^{-1}$ for all $a, b \in G$. Then $(G, \rightarrow, \rightsquigarrow, e )$ is a pseudo CI-algebra. \end{example} \section{Main Results} In this section, we define the notion of pseudo CI-filter on pseudo CI-algebras. There are some relations between prime pseudo CI-filters, maximal pseudo CI-filters and generated pseudo CI-filters. We introduce $A(x, y)$ as pseudo upper set of $x$ and $y$ and we check its connection to the pseudo CI-filters. \vspace{3pt} In the following, let $X$ denote a pseudo CI-algebra unless otherwise specified. \begin{definition}\label{3.1} {\it A non-empty subset $F$ of $X$ is called a pseudo CI-filter of $X=(X; \rightarrow , \rightsquigarrow , 1)$ if it satisfies in the following axioms: $(F1)$ $ \ \ 1\in F$, $(F2) \ $ If $x\in F$ and $x\rightarrow y\in F$ imply $y\in F$, for all $x, y\in X$.} \end{definition} A pseudo CI-filter $F$ is proper if and only if $F \neq X$. \begin{proposition}\label{3.2} {\it Let $F$ be a pseudo CI-filter of $X$. If $x\in F$, $ y\in X$ and $x\leq y$. Then $y\in F$.} \begin{proof} Let $x\leq y$, so, by (F1) $x\rightarrow y=1\in F$. Since $x\in F$, by (F2) $y\in F$. \end{proof} \end{proposition} \begin{proposition}\label{3.3} {\it Let $F\subseteq X$ and $1\in F$. $F$ is a pseudo CI-filter if and only if, $(F3) \ $ $ \ x\in F$ and $x\rightsquigarrow y \in F$ implies $y\in F$, for all $x,y\in X$.} \begin{proof} Let $x \in F$ and $x\rightsquigarrow y\in F$. By Proposition \eqref{2.8}(1), $x\leq ((x\rightsquigarrow y)\rightarrow y)$. Since $x \in F$, by (F2) $(x\rightsquigarrow y)\rightarrow y \in F$. By assumption $x\rightsquigarrow y \in F$. Hence $y \in F$.\\ Conversely, let $x\in F$ and $x\rightarrow y \in F$. By Proposition \eqref{2.9}(3), $(x\rightsquigarrow ((x\rightarrow y)\rightsquigarrow y) = 1$. By assumption $1 \in F$, so $(x\rightsquigarrow ((x\rightarrow y)\rightsquigarrow y)\in F$. $x \in F$ , by (F3) $(x\rightarrow y)\rightsquigarrow y)\in F$. By assumption $(x\rightarrow y)\in F$.\\ Hence $y \in F$, therefore $F$ is a pseudo CI-filter. \end{proof} \end{proposition} \begin{example}\label{3.4} $(i)$ $\{1\}$ and $X$ are pseudo CI-filter of $X$, in which we call trivial pseudo CI-filter. $(ii)$ Let $X=(X;\rightarrow ,\rightsquigarrow ,1)$ be pseudo CI-algebra in Example \eqref{2.7}. Then $F_{1}=\{1,a,c\}$, $F_{2}=\{1,b,c\}$ and $F_{3}=\{1,a\}$ are pseudo CI-filter on $X$. But $\{1,a,b\}$ is not pseudo CI-filter on $X$. $(iii)$ In example \eqref{2.13}, let $G=(0, +\infty)$, and binary operation "$\cdot$" be the ordinary product on $G$. Then $(G, \cdot)$ is a group with identity $1$. $(G, \rightarrow, \rightsquigarrow, 1)$ is pseudo CI-algebra. Let $Q$ be rational numbers. $Q$ is a pseudo CI-filter. \end{example} \begin{definition}\label{3.5} {\it A non-empty subset $S$ of a pseudo CI-algebra $X$ is said a subalgebra of $X$ if $x\rightarrow y\in S$ and $x\rightsquigarrow y\in S$ for all $x,y\in S$.} \end{definition} \begin{proposition}\label{3.6} {\it For any pseudo CI-algebra X, the set $K(X)= \{x\in X : x\leq 1\}$ is a pseudo subalgebra of $X$.} \begin{proof} Let $x,y \in K(X)$. Then $x\le 1$ and $y\le 1$. Hence; \begin{center} $x\rightarrow 1=x\rightsquigarrow 1=1$ and $y\rightarrow 1=y\rightsquigarrow 1=1$. \end{center} From, proposition \eqref{2.8},(3) we have; $(x\rightarrow y)\rightarrow 1=(x\rightarrow 1)\rightsquigarrow (y\rightsquigarrow 1)=1\rightsquigarrow 1=1$ and $(x\rightsquigarrow y)\rightsquigarrow 1=(x\rightsquigarrow 1)\rightarrow (y\rightarrow 1)=1\rightarrow 1=1$. So, $x\rightarrow y,\ x\rightsquigarrow y\in K(X)$. Thus $K(X)$ is a pseudo subalgebra of $X$. \end{proof} \end{proposition} \vspace{4pt} {\bf Note.} Always any pseudo CI-filter of $X$ is not a pseudo subalgebra. In example \eqref{2.10}, $ \ F= \{1, b, c\} $ ia a pseudo CI-filter in $X$. Since $b rightarrow c=e notin F$, therefore $F$ is not a pseudo subalgebra of $X$. \vspace{4pt} \begin{proposition}\label{3.7} {\it Let $F$ be a subset of $X$ containing 1. $F$ is pseudo CI-filter of $X$ if and only if: $(i) \ \ $ $x\leq y\rightarrow z$ imply $z\in F$, for all $x,y\in F$ and $z\in X$. $(ii) \ $ $x\leq y\rightsquigarrow z$ imply $z\in F$, for all $x,y \in F$ and $z\in X$.} \begin{proof} $(i) $ ($\Rightarrow $). Assume that $F$ is a pseudo CI-filter of $X$ and $x,y,z \in X$ such that $x,y \in F$ and $x\leq z\rightarrow y$. Then $x\rightsquigarrow (y\rightarrow z) =1\in F$, $ \ \ x\in F$ so $y\rightarrow z\in F$. Since $y \in F$, therefore $z\in F$. ($\Leftarrow $). By assumption, $1\in F$. Let $y\in X$ and $x,x\rightsquigarrow y\in F$ . From proposition \eqref{2.9},(3) $x\rightsquigarrow ((x\rightsquigarrow y)\rightarrow y) = 1$. Hence $x\leq (x\rightsquigarrow y)\rightarrow y$. Since $x, x\rightsquigarrow y \in F$, therefore $y \in F$. By Proposition \eqref{3.3}, $F$ is a pseudo CI-filter. $(ii) $ It is proved in the same way $(i)$. \end{proof} \end{proposition} \begin{proposition}\label{3.8} {\it Let $A$ be a pseudo CI-filter of a pseudo CI-algebra $X$. If $B$ is a pseudo CI-filter of $A$, then $B$ is a pseudo CI-filter of $X$.} \begin{proof} Since $B$ is a pseudo CI-filter of $A$, we have $1\in B$. Let $x, x\rightarrow y\in B$ for some $y\in X$. If $y\in A$, then $y\in B$. Since $B$ is a pseudo CI-filter of $A$. If $y \in X\setminus A$, since $x, x\rightarrow y \in B \subseteq A$ and, $A$ is a pseudo CI-filter of $X$ implies $x\in A$. This is impossible. Thus $y\in B$. Therefore $B$ is a pseudo CI-filter of $A$. \end{proof} \end{proposition} \begin{proposition}\label{3.9} {\it If $\{F_{i}\}_{i\in I}$ be a family of pseudo CI-filters of $X$, then $\bigcap_{i\in I}\{F_{i}\}$ is a pseudo CI-filter of $X$, too.} \end{proposition} \vspace{4pt} A Maximal pseudo CI-filter is a proper CI-filter such that it is not included in any other proper pseudo CI-filter. Denote by $F(X)$ the set of all pseudo CI-filters of $X$ and $M(X)$ the set of all Maximal pseudo CI-filters of $X$. \vspace{4pt} \begin{definition}\label{3.10} {\it Let $X$ be a pseudo CI-algebra. Then $P\in F(X)$ is called prime if and only if, for all $F_{1}, F_{2} \in F(X) $such that $F_{1}\cap F_{2} \subseteq P$, implies $F_{1} \subseteq P$ or $F_{2}\subseteq P$.\\ \vspace{2pt} The set of all proper prime pseudo CI-filters of $X$ is denoted by $P(X)$ and called the prime spectrum of $X$.} \end{definition} \begin{example}\label{3.11} Let $(X,\rightarrow, \rightsquigarrow , 1)$ be the pseudo CI-algebra from example \eqref{2.7}. Then $F(X) = \{F_{1}=\{1\}, \ F_{2}=\{1, a, c \}, \ F_{3}=\left\{1,\ b,\ c\right\}, \ F_{4}=\left\{1,\ \ a\right\}, \ F_{5}=X\}$ and $P(X) =M(X)=\{F_{2}, \ F_{3}\}$. \end{example} For element $a$ of $X$, put $T(a)=\{x\in X: a\leq x\}$, which is called the terminal section of an element $a$. Since $ a\in T(a)$, we can see that $T(a)$ is not an empty set. \begin{proposition}\label{3.12} {\it For any element a of $X$, if, $1\in T(a)$. Then $T(a)$ is a pseudo CI-filter if and only if one of the following implications hold: $(i)$ For all $x, y, z \in X$, $ z\leq x\rightarrow y$, and $z\leq x$ then $ z \leq y$; $(ii)$ For all $x, y, z \in X$, $ z\leq x \rightsquigarrow y$, and $z\leq x$ then $ z \leq y$.} \begin{proof} $(i)$ Let for each $a\in X$, $T(a)$ is a pseudo CI-filter of $X$. Assume that $x, y, z \in X$, such that $z \leq x\rightarrow y$ and $z \leq x$. Then $x \rightarrow y \in T(z)$ and $x \in T(z)$. By hypothesis $T(z)$ is pseudo CI-filter, so $y \in T(z)$. Therefore, $z \leq y$. $(ii)$ Is similarly way. Conversely, let $a\in X$. By hypothesis $1\in T(a)$. Let $x \rightarrow y\in T(a)$, and $x\in T(a)$, then, $a \leq x \rightarrow y$, and $a \leq x$. From hypothesis, $a\leq y$, thus $y \in T(a)$. Hence $T(a)$ is a pseudo CI-filter of $X$, for all $a\in X$. \end{proof} \end{proposition} \begin{proposition}\label{3.13} {\it Let $F$ be a subalgebra of $X$. Then $F$ is a pseudo CI-filter of $X$ if and only if for all $x, y\in X$, \begin{equation} x \in F \ and \ y \in X\setminus F \ then \ x\rightarrow y\in X\setminus F \ and \ x\rightsquigarrow y\in X\setminus F. \end{equation}} \begin{proof} Let $F$ be a pseudo CI-filter of $X$. We prove (1) by contradiction. Assume $x, y \in X$, $x \in F$ and $y\in X\setminus\ F$. If $x\rightarrow y \notin X\setminus F$, then $x\rightarrow y \in F$. $F\in F(X)$, so $y \in F$, which is a contradiction. Hence $x\rightarrow y \in X\setminus F$. Now, if $x\rightsquigarrow y\notin X\setminus F$, then $x\rightsquigarrow y \in F$, and so, $y\in F$, which is a contradiction. Hence $x\rightsquigarrow y \in X\setminus F$. Conversely, assume that (1) hold. Since $F\neq \emptyset$ is a subalgebra, there is $a\in F$. We have $a\rightarrow a = 1 \in F$. Let $x\in F$ and $x\rightarrow y \in F$. If $y\notin F$, then by (1) $x\rightarrow y \in X\setminus F$, which is a contradiction with $x\rightarrow y\in F$. Hence $y\in F$. Therefore, $F$ is a pseudo CI-filter. \end{proof} \end{proposition} \begin{proposition}\label{3.14} {\it Let $F$ be a pseudo CI-filter of $X$. For all $x \in F$: \begin{center} $(x \rightarrow 1)\rightsquigarrow 1\in F \ \ and \ (x \rightsquigarrow 1)\rightarrow 1\in F $. \end{center}} \end{proposition} \begin{proposition}\label{3.15} {\it Let $F$ be a pseudo CI-filter of $X$ and let $\tilde{F}=\{x\in X:\ (x\rightarrow 1)\rightsquigarrow 1,\ (x\rightsquigarrow 1)\rightarrow 1\in F\}$. Then $\tilde{F}$ is a pseudo CI-filter of $X$ and $F\subseteq \tilde{F}.$} \begin{proof} Obviously,$1\in \tilde{ F}$. Let $x,y \in X$ such that $x, x\rightarrow y \in \tilde{\ F}$. By hypothesis $\ (x\rightarrow 1)\rightsquigarrow 1$ , $\ (x\rightsquigarrow 1)\rightarrow 1\in F$, and $((x\rightarrow y)\rightarrow 1))\rightsquigarrow 1, \ $ $((x\rightarrow y)\rightsquigarrow 1))\rightarrow 1\in F$.\\ Using Proposition \eqref{2.8},(3), we have;\\ $\left[\left(\left(x\rightarrow 1\right)\rightsquigarrow 1\right)\right]\rightarrow \left[\left(\left(y\rightsquigarrow 1\right)\rightarrow 1\right)\right]=\left(\left(x\rightarrow 1\right)\rightsquigarrow \left(y\rightsquigarrow 1\right)\right)\rightsquigarrow 1=((x\rightarrow y)\rightarrow 1)\rightsquigarrow 1\in F$, and, $\left[\left(\left(x\rightsquigarrow 1\right)\rightarrow 1\right)\right]\rightsquigarrow \left[\left(\left(y\rightarrow 1\right)\rightsquigarrow 1\right)\right]=\left(\left(x\rightsquigarrow 1\right)\rightarrow \left(y\rightarrow 1\right)\right)\rightarrow 1=((x\rightsquigarrow y)\rightsquigarrow 1)\rightarrow 1\in F$. Since $\ (x\rightarrow 1)\rightsquigarrow 1,\ $ $(x\rightsquigarrow 1)\rightarrow 1\in F$. It follows from (F2) that $\ (y\rightarrow 1)\rightsquigarrow 1,\ $ $(y\rightsquigarrow 1)\rightarrow 1\in F$. Hence $y \in \tilde{F}$. Thus $\tilde{F}$ is a pseudo CI-filter of X. By Proposition \eqref{3.14}, $F\subseteq \tilde{F}$. \end{proof} \end{proposition} \begin{definition}\label{3.16} {\it Let $X=(X, \ \rightarrow ,\ \rightsquigarrow ,\ 1)$ and $Y=(Y,\ {\rightarrow }^{'},\ {\rightsquigarrow }^{'},\ 1^{'})$ be pseudo CI-algebras. A mapping $f:\ X\ \longrightarrow \ Y$ is called a pseudo homomorphism if for all $x,\ y \in \ X$,\\ \begin{center} $f(x\rightarrow y) = f(x){\rightarrow }^{'} f(y)\ $ and $ \ f(x\rightsquigarrow y)=f(x){\rightsquigarrow }^{'} f(y)$. \end{center}} \end{definition} From now, assume $X=(X; \rightarrow , \rightsquigarrow , 1)$ and $Y=(Y; {\rightarrow }^{'}, {\rightsquigarrow }^{'}, 1^{'})$ be pseudo CI-algebras.\\ Let $f: X \rightarrow Y$ be a pseudo homomorphism from $X$ to $Y$, we define $Ker(f)=\{x\in X: f(x)=1^{'} \}$. Since $f(1)=f(1\rightarrow 1)= f(1){\rightarrow }^{'} \ f(1)= \ 1^{'} {\rightarrow }^{'} 1^{'} = 1^{'}$. So $1\in Ker(f)$ and $Ker(f)\neq \phi$. \begin{proposition}\label{3.17} {\it Let $f:\ X\ \longrightarrow \ Y\ $be a pseudo homomorphism. Then,\\ $(i)$ If $F$ is a pseudo CI-filter of $Y$, then $f^{-1}(F)$ is a pseudo CI-filter of $X$,\\ $(ii)$ If $f$ is surjective and $G$ is a pseudo CI-filter of $X$ containing $Ker(f)$, then $f(G)$ is a pseudo CI-filter of $Y$.} \begin{proof} $(i)$ Assume that $F$ is a pseudo CI-filter of $X$. From above $1\in \ f^{-1}(F)$. Let $x,\ x\rightarrow y\ \in f^{-1}(F)$. It follows that $f(x)$, $\ f(x)\rightarrow f(y)=f(x\rightarrow \ y)\in F$. Since $F$ is pseudo CI-filter and $f(x)\in F$, then $f(y) \in \ F$. Therefore, $y \in f^{-1}(F)$ and hence $f^{-1}(F)$ is a pseudo CI-filter of X. $(ii)$ From above and hypothesis $1^{'}\in Ker(f) \subseteq f(G)$ so $1^{'}\in f(G)$. Let $y \in \ Y$ and $x,\ x{\rightarrow }^, y\ \in \ f(G)$. Since $f$ is surjective, there exists $a\in X$ such that $f(a) = y$ and $\exists b, c \in \ G$, such that $f(b)=x$ and $f(c)= x\rightarrow ^{,}y$. We have; \begin{center} $f(c) = x{\rightarrow }^,y = f(b){\rightarrow }^, f(a) = f(b\rightarrow a)$. \end{center} Thus $f(c\rightarrow (b\rightarrow a))=1^{,}$ and hence $c\rightarrow (b\rightarrow a)\in Ker(f)\subseteq G$. Therefore, $c\rightarrow (b\rightarrow a)\in G$. Since $c\in G$, we see that $(b\rightarrow a)\in G \ $, since $b\in G$ so $a\in G$. Hence $y =\ f(a)\in \ f(G)$. Consequently, $f(G)$ is a pseudo CI-filter of $Y$. \end{proof} \end{proposition} In the following example we show that if $f$ is not surjective in proposition \eqref{3.16}, $(ii)$, $f(G)$ is not a pseudo CI-filter of $Y$. \begin{example}\label{3.18} Let $X$ be pseudo CI-algebra in Example \eqref{2.7}, and $Y= \{1, a, b, c\}$. Define $\rightarrow $, $\rightsquigarrow $ as follow: \vspace{5pt} \begin{center} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt}} $\rightarrow $ & $1$ & $a$ & $b$ & $c$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ \\ $a$ & $1$ & $1$ & $a$ & $1$ \\ $b$ & $1$ & $1$ & $1$ & $1$ \\ $c$ & $1$ & $a$ & $a$ & $1$ \\ \end{tabular} \qquad\;\;\;\;\;\;\ \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt}} $\rightsquigarrow $ & $1$ & $a$ & $b$ & $c$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ \\ $a$ & $1$ & $1$ & $a$ & $1$ \\ $b$ & $1$ & $1$ & $1$ & $1$ \\ $c$ & $1$ & $a$ & $a$ & $1$ \\ \end{tabular} \end{center} \vspace{5pt} Then $(Y; \rightarrow , \rightsquigarrow , 1)$ is a pseudo CI-algebra. (Note, in the two pseudo CI-algebra are the operations with a symbol) Now, if we consider $f : Y\longrightarrow X$ the identity map, then $f$ is a pseudo homomorphism and $f(Y)=Y$. Everyone can easily see that $Y=\{1, a, b, c\}$ is a trivial pseudo CI-filter of $Y$, but $f(Y)$ is not a pseudo CI-filter of $X$, because $a\rightarrow d =a\in f(Y)$ and $a\in f(Y)$ but $d\notin f(Y)$. \end{example} Let $f : X \longrightarrow Y$ be a pseudo homomorphism. Then $Im(f)$ is a pseudo subalgebra of $Y$. Obviously, $Im(f)$ is a non-empty set. If $y_{1}, y_{2} \in Im(f)$, then there exist $x_{1}, x_{2} \in X$ such that $y_{1} = f(x_{1})$ and $y_{2} = f(x_{2})$, thus $y_{1} \rightarrow y_{2} = f(x_{1}) \rightarrow f(x_{2}) = f(x_{1} \rightarrow x_{2}) \in Im(f)$. And $y_{1} \rightsquigarrow y_{2} = f(x_{1}) \rightsquigarrow f(x_{2}) = f(x_{1} \rightsquigarrow x_{2}) \in Im(f)$. Consequently, $Im(f)$ is a pseudo subalgebra of $Y$. This is an example that shows "a pseudo subalgebra is may not be pseudo CI-filter". \begin{corollary}\label{3.19} {\it Let $f : X \longrightarrow Y$ be a pseudo homomorphism. Then $Ker(f)$ is a pseudo CI-filter of $X$.} \end{corollary} \begin{definition}\label{3.20} {\it Let $x, y \in X$. Define $A(x,\ y)=\ \{z\in X: \ x\rightarrow (y \rightsquigarrow z)=1\}$. We call $A(x,\ y)\ $ a pseudo upper set of $x$ and $y$.} \end{definition} \begin{proposition}\label{3.21} {\it In a pseudo CI-algebra $X=(X; \rightarrow ,\ \rightsquigarrow ,\ 1)$, for all $x, y\in X$ we have:\\ $(i)$ If $y\leq 1$, then $A(x,\ 1)\ \subseteq \ A(x,\ y)$, for all $x\in X$,\\ $(ii)$ if $A(x,\ 1)$ be a pseudo CI-filter of $X$ and $y \in A(x,\ 1)$, then $A(x,\ y)\subseteq A(x,\ 1)$.}\\ \begin{proof} $(i)$ Let $z\in A(x,\ 1)$. Then $x\rightarrow (1\rightsquigarrow z)=x\rightarrow z\ = 1$. Thus, by (pCI3) and $\ y\leq 1 \ $, $x\rightarrow \left(y\rightsquigarrow z\right)=y\rightsquigarrow \left(x\ \rightarrow z\right)=y\rightsquigarrow 1=1$. Thus $z\ \in \ A(x,\ y)$ and so $A(x,\ 1) \subseteq A(x,\ y)$.\\ $\left(ii\right)$ Let $A(x,\ 1)\ $be a pseudo CI-filter, $y\in A(x,\ 1)$. Let $z\in A(x,\ y)$, then $x\rightarrow (y\rightsquigarrow z)=1$. Since $x\in A(x,\ 1)$ and $A(x,\ 1)\ $is a pseudo CI-filter, therefore $y\rightsquigarrow z\in A(x,\ 1)$. Now, since $y \in A(x,\ 1)$ then $z \in A(x,\ 1)$. Thus $A(x,\ y) \subseteq A(x,\ 1)$. \end{proof} \end{proposition} {\bf Note:} In example \eqref{2.10}. $(i)$ $A(x, 1) = \{z: \ x\rightarrow (1\rightsquigarrow z=1\}=\{z: \ x\rightarrow z =1=\} = \{1 \}$. For all $x \in X$.\\ $(ii)$ $A\left(a,\ b\right)=\left\{c\right\}$ and $A\left(b,\ a\right)=\left\{d\right\}$. This shows in general $A\left(a,\ b\right)\neq A\left(b,\ a\right)$ and $1\notin A\left(a,\ b\right)$.\\ $(iii)$ The set $A(x,\ y)$, where $x,\ y\in X$, is not a pseudo CI-filter of $X$, in general. \begin{proposition}\label{3.22} {\it Let $x \in X$, set $T=\{y:y\leq 1\}$. Then $A\left(x,\ 1\right)=\bigcap_{y\in T}{A(x,\ y)}$.} \begin{proof} By Proposition \eqref{3.21}, $(i)$, we have $A(x,\ 1)\ \subseteq \ A(x,\ y)$, for all $y\in T.\ So\ A\left(x,\ 1\right)\subseteq \bigcap_{y\in T}{A(x,\ y)}$. Let $z\in \bigcap_{y\in T}{A(x,\ y)}$. Then $z\ \in \ A(x,\ y)$, for all $y\in T$, and $1\in T$ so $z \in A(x,\ 1)$. Hence $A\left(x,\ 1\right)\subseteq \bigcap_{y\in T}{A(x,\ y)\subseteq A(x,\ 1)}$. \end{proof} \end{proposition} \begin{proposition}\label{3.23} {\it Let $F$ is a pseudo CI-filter of $X$. The following holds:\\ $(i)\ \ $ $A(x, \ y) \subseteq F$, for all $x,y \in F$,\\ $(ii)\ \ $ $F=\bigcup_{x,y\in F}{A(x,\ y)}$, \\ $(iii) \ $ $F=\bigcup_{x\in F}{A(x,\ 1)}$.} \begin{proof} Let $F$ be a pseudo CI-filter of $X$; $(i)$ Assume $x, y\in F$. If $z \in A(x,\ y)$, then $x\rightarrow (y\rightsquigarrow z) = 1\in F$. Since $F$ is a pseudo CI-filter and $x \in F$, by using (F2), $y\rightsquigarrow z\in F$. $y \in F$ again by (F2), $z \in F$. Hence $A(x,\ y) \subseteq F$. $(ii)$ Let $z \in F$. Since $ z\rightarrow (1 \rightsquigarrow z)= z \rightarrow z=1$, we have $z \in A(z,\ 1)$. Hence $F\subseteq \bigcup_{x,y\in F}{A(x,\ y)}$. Let $z\in \bigcup_{x,y\in F}{A(x,\ y)}$, then there exist $a, b \in F$ such that $z \in A(a,\ b)$. By $(i)$, $A(a,\ b) \subseteq F$, we have $z \in F$. This means that $\bigcup_{x,y\in F}{A(x,\ y)}\subseteq \ F$. $(iii)$ Since $1\in F$, put $y=1$ in equation $F=\bigcup_{x,y\in F}{A(x,\ y)}$ of $(ii)$ it is proved. If $y\in F$. Since $y\rightarrow (1\rightsquigarrow y)=y\rightarrow y=1\in F$, we have, $y\in A(y,\ 1)$. Hence $F\subseteq \bigcup_{x\in F}{A(x,\ 1)}$. Now, let $y\in \bigcup_{x\in F}{A(x,\ 1)}$, then there exist an $a \in F$ such that $y\in \ A(a,\ 1)$, which means that $a \rightarrow y=a \rightarrow (1\rightsquigarrow y)=1\in F$. Since $F$ is a pseudo CI-filter of$\ X$ and $a\in F$, we see that $y\in F$. This means that $\bigcup_{x\in F}{A(x,\ 1)}\subseteq \ F$. \end{proof} \end{proposition} \section{Congruences relations} We define the notion of congruence relations on pseudo CI-algebras. There are some relations between pseudo CI-filters and pseudo congruence. In this section, let $X$ denote a pseudo CI-algebra unless otherwise specified. \begin{definition}\label{4.1} {\it Let ''$\theta $'' be an equivalence relation on $X$, ''$\theta $'' is called: $(i)$ Right congruence relation on $X$ if $(x,y)\in \theta $ implies $(x\rightarrow z, \ y\rightarrow z)\in \theta $ and $(x\rightsquigarrow z, \ y\rightsquigarrow z)\in \theta $, for all $z\in X$. $(ii)$ Left congruence relation on $X$ if $(x,y) \in \theta $ implies $(w\rightarrow x,w\rightarrow y)\in \theta $ and $(w\rightsquigarrow x,w\rightsquigarrow y)\in \theta $, for all $w\in X$. $(iii)$ Congruence relation on $X$ if has the substitution property with respect to ''$\rightarrow $'' and ''$\rightsquigarrow $'',i.e., for any $(x,y),(z,w)\in \theta $ then $(x\rightarrow z,\ y\rightarrow w)\in \theta $ and $(x\rightsquigarrow z, y\rightsquigarrow w)\in \theta $.} \end{definition} \begin{example}\label{4.2} $(i)$ It is obvious that $\ X\ \times X$ and $\triangle =\{(x,x):\ x \in X\}$ is a congruence relation on $X$. \\ $(ii)$ Let $X=\{1,a,b,c\}$ and operations ''$\rightarrow $'' and ''$\rightsquigarrow $'' defined as follows: \vspace{5pt} \begin{center} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt}} $\rightarrow $ & $1$ & $a$ & $b$ & $c$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ \\ $a$ & $a$ & $1$ & $c$ & $1$ \\ $b$ & $a$ & $1$ & $1$ & $1$ \\ $c$ & $1$ & $a$ & $b$ & $1$ \\ \end{tabular} \qquad\;\;\;\;\;\;\;\; \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt}} $\rightsquigarrow $ & $1$ & $a$ & $b$ & $c$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ \\ $a$ & $a$ & $1$ & $a$ & $1$ \\ $b$ & $a$ & $1$ & $1$ & $1$ \\ $c$ & $1$ & $a$ & $a$ & $1$ \\ \end{tabular} \end{center} \vspace{5pt} Then $X=\{X; \rightarrow , \rightsquigarrow , 1)$ is a pseudo CI-algebra (is not BL-algebra) ${\theta }_{1}= \{(1,1),(a,a),(b,b),(c,c),(1,b),(b,1),(b,c),(c,b)\}$ is a left congruence relation on $X$, but it is not right congruence relation because $(c,b)\in {\theta }_{1}$ but $(c\rightarrow a, \ b\rightarrow a)=(a,1)\notin {\theta }_{1}$ . ${\theta }_{2}=\{\left(1,1\right),\left(a,a\right),\left(b,b\right),\left(c,c\right),\left(c,b\right),\left(b,c\right)\}$, then ${\theta }_{2}$ is a right congruence relation. Since $(b,c)\in {\theta }_{2}$ and $a \in X$, but $(a,1)\ =\ (a\rightarrow b,a\rightarrow c)\notin {\theta }_{2}$, it follows that ${\theta }_{2}$ is not a left congruence neither a congruence relation. \end{example} \vspace{3pt} In this section we assume that, $\theta $ be congruence relation on $X$. we will denote $C_{x}(\theta ) = \{y\in X:\ y\ {\sim }_{\theta }x\}$, abbreviated by $C_{x}$ and ${X}/{\theta }=\{C_{x}:x\in X\}$. \vspace{3pt} \begin{proposition}\label{4.3} {\it Let $A$ be the set of all atom element of $X$. Then $C_{1}=\{x\in A:\ x\ {\sim }_{\theta }1\}$ is a pseudo CI-filter of $X$.} \begin{proof} Since $\theta $ is a reflexive relation, we see that $(1,1)\in \theta $ and so $1{\sim }_{\theta }1$. Thus $1\in C_{1}$. Now, let $x\in X $. Assume that $a\in C_{1}$, $a\rightarrow x\in C_{1}$. Then $a{\sim }_{\theta }1$ and $a\rightarrow x{\sim }_{\theta }1$. $\theta $ is congruence relation on $X$, we have $((a\rightarrow x)\rightsquigarrow x){\sim }_{\theta }(1\rightsquigarrow x)$. $a$ is atom element, by proposition \eqref{2.12},(2) and (pCI2), we have $a=((a\rightarrow x)\rightsquigarrow x){\sim }_{\theta }(1\rightsquigarrow x)=x$. Since $a\in C_{1}$, therefor $1 {\sim }_{\theta } a {\sim }_{\theta } x$ and so $x\in C_{1}$. This shows that $C_{1}$ is a pseudo CI-filter of $X$. \end{proof} \end{proposition} \begin{definition}\label{4.4} {\it A pseudo CI-algebra $X$ is said to be transitive if for all $x, y, z\in X$, \begin{equation}\nonumber (y\rightarrow z)\rightarrow [(x\rightarrow y)\rightarrow (x\rightarrow z)] =1 \ and \ (y\rightsquigarrow z)\rightsquigarrow [(x\rightsquigarrow y)\rightsquigarrow (x\rightsquigarrow z)] = 1. \end{equation}} \end{definition} \begin{proposition}\label{4.5} {\it Let $X=\{X; \rightarrow , \rightsquigarrow , 1)$ be transitive pseudo CI-algebra and $F$ be a pseudo CI-filter of $X$. Define $x{\sim }_{F} y$ if and only if $x\rightarrow y,\ y\rightarrow x\in F$ and $\ x\rightsquigarrow y,\ y\rightsquigarrow x\in F$. Then ${\sim }_{F}$ is congruence relation on $X$.} \begin{proof} Since $1\in F$, we have $x\rightarrow x=1\in F $, $i.e.$, $x\ {\sim }_{F}x$. This means that'' ${\sim }_{F}$ '' is reflexive. It is obvious ${\sim }_{F}$ is symmetric. Now, if $x\ {\sim }_{F} y$ and $y\ {\sim }_{F} z$, then $x\rightarrow y, \ y\rightarrow x, \ x\rightsquigarrow y, \ y\rightsquigarrow x \in F$ and $y\rightarrow z, z\rightarrow y, \ y\rightsquigarrow z,\ z\rightsquigarrow y\in F$. Since $X$ is transitive CI-algebra, so $(y\rightarrow z)\leq (x\rightarrow y)\rightarrow (x\rightarrow z) \ $ and $(y\rightsquigarrow z)\leq (x\rightsquigarrow y)\rightsquigarrow (x\rightsquigarrow z)$. By hypothesis $y\rightarrow z, \ y\rightsquigarrow z \in F $. Since $F$ is a pseudo CI-filter, it follows that $(x\rightarrow y)\rightarrow (x\rightarrow z), \ (x\rightsquigarrow y)\rightsquigarrow (x\rightsquigarrow z) \in F$. Because $(x\rightarrow y), \ (x\rightsquigarrow y) \in F$ and $F$ is a pseudo CI-filter, so $x\rightarrow z, \ x\rightsquigarrow z \in F$. By a similar way we see that $z\rightarrow x, \ z\rightsquigarrow x \in F$. This shows that '' ${\sim }_{F}$ '' is transitive. Therefore, '' ${\sim }_{F}$ '' is an equivalence relation on $X$. Now, let $x\in X$ and $u{\sim }_{F}v$. Then by definition \eqref{4.4}, $v\rightarrow u \leq (x\rightarrow v)\rightarrow (x\rightarrow u)$. Now, since $v\rightarrow u\in F$ and $F$ is a pseudo CI-filter, then $(x\rightarrow v)\rightarrow (x\rightarrow u)\in F$. By a similar way, $(x\rightarrow u)\rightarrow (x\rightarrow v)\in F$. Therefore, $x\rightarrow v{\sim }_Fx\rightarrow u$. Also, $u\rightsquigarrow v\leq (x\rightsquigarrow u)\rightsquigarrow (x\rightsquigarrow v)$. Since $u\rightsquigarrow v\in F$ and $F$ is a pseudo CI-filter, we have $(x\rightsquigarrow u)\rightsquigarrow (x\rightsquigarrow v)\in F$. By a similar way, $(x\rightsquigarrow v)\rightsquigarrow (x\rightsquigarrow u)\in F$. Therefore, $x\rightsquigarrow v{\sim }_F\ x\rightsquigarrow u$. Therefore, ${\sim }_{F}$ is congruence relation on $X$. \end{proof} \end{proposition} \begin{example}\label{4.6} Let $X = \{1, a, b, c, d\}$ and $( X, \rightarrow , \rightsquigarrow , 1)$ be pseudo CI-algebra of example \eqref{2.7}, $F = \{1, a, d\}$ is a pseudo CI-filter. We have;\\ ${\sim }_{F}= \{(1, 1),(a, a),(b, b),(c, c),(d, d),(1, a),(a, 1),(d, 1),(1, d), (a, d),(d, a),(b, c),(c, b)\}$,\\ and so "${\sim }_{F}$" is equivalence relation and congruence relation. \end{example} \begin{proposition}\label{4.7} {\it If CI-algebra $X$ be transitive, then for all $x, y, z \in X$, $(i)$ $y\leq z$ implies $x\rightarrow y\leq x\rightarrow z$, $(ii)$ $y\leq z$ implies $z\rightarrow x\leq y\rightarrow x$, $(iii)$ $1\leq x$ implies $x=1$.} \begin{proof} $(i)$ If $y\leq z$ (Or $y\rightarrow z=1$), then by (pCI2) and transitive $X$ we have; $\left(x\rightarrow y\right)\rightarrow \left(x\rightarrow z\right)=1\rightarrow [\left(x\rightarrow y\right)\rightarrow \left(x\rightarrow z\right)]=(\ y\rightarrow z)\rightarrow [(x\rightarrow y)\rightarrow (x\rightarrow z)]\ =\ 1$,\\ So, $x\rightarrow y\leq x\rightarrow z$. $(ii)$ Let $y\leq z$. Since $\left(z\rightarrow x\right)\rightarrow \left(y\rightarrow x\right)=\left(z\rightarrow x\right)\rightarrow [1\rightarrow \left(y\rightarrow x\right)]=(\ z\rightarrow x)\rightarrow [(y\rightarrow z)\rightarrow (y\rightarrow x)]\ =\ 1$ and $(ii)$ holds. $(iii)$ Follows from (pCI2). (Note that, $(iii)$ holds in every CI-algebra.) \end{proof} \end{proposition} \begin{definition}\label{4.8} {\it Let $A$ be a nonempty subset of $X$. If $F$ is the least pseudo CI-filter containing $A$ in $X$, then $F$ is said to be the pseudo CI-filter generated by $A$ and is denoted by $(A]$. If $A$ is a finite set of $X$ then $(A]$ is said to be finitely generated.} \end{definition} Since $X$ is always a pseudo CI-filter of $X$ containing any pseudo CI-filter, it follows from proposition \eqref{4.7}, that definition \eqref{4.8}, is well defined. The pseudo CI-filter generated by finite set $\{a_{1},··· ,a_{n}\}$ is simply denoted by $(a_{1},··· ,a_{n}]$. For convenience, let $(\phi]= \{1\}$. \begin{proposition}\label{4.9} {\it Suppose $A$ and $B$ are two subsets of $X$. Then the following hold:\\ $(i)$ $(1] =\{1\}, (X]=X$,\\ $(ii)$ $ A \subseteq B$ implies $(A]\subseteq (B]$,\\ $(iii)$ If $F$ is a pseudo CI-filter of $X$, then $(F]=F$.} \end{proposition} \begin{proposition}\label{4.10} {it Let $A$ be a nonempty subset of $X$. Then $(A]=\{x\in X: \prod\limits_{i=1}^n (a_{i} \rightarrow x)=1, \exists a_{1},···,a_{n}\in A\}$.}\\ {\bf Note:} $(\prod \limits_{i=1}^n (a_{i} \rightarrow x)=(a_{1}\rightarrow ...\rightarrow (a_{n-1}\rightarrow (a_{n}\rightarrow x)))$.\\ \begin{proof} Let $F=\{x\in X: \prod\limits_{i=1}^n (a_{i} \rightarrow x)=1, \exists a_{1},···,a_{n}\in A\}$. Since $a\rightarrow a=1$ for all $a\in A$, so $A\subseteq F$. By proposition \eqref{4.8} $(ii)$, $ \ (iii) $, $(A]\subseteq F$. Now, by (pCI1) $1\rightarrow 1=1$, so $1\in F$. Let $x\rightarrow y\in F$ and $x\in F$, then there are $a_{1},···,a_{n}, b_{1},···,b_{m} \in A$ such that, $\prod \limits_{i=1}^n (a_{i} \rightarrow (x\rightarrow y))=1$ and $\prod\limits_{i=1}^m (b_{i} \rightarrow x)=1$. Hence $x\leq \prod \limits_{i=1}^n (a_{i} \rightarrow y)$. Since $X$ is a transitive CI-algebra, by using Proposition \eqref{4.6},(1) we obtain $1= \prod \limits_{i=1}^n (b_{i} \rightarrow x)\leq \prod \limits_{i=1}^m b_{i}\rightarrow (\prod \limits_{i=1}^n (a_{i} \rightarrow y))$. By Proposition \eqref{4.6},(3)\\ $\prod \limits_{i=1}^m b_{i}\rightarrow (\prod \limits_{i=1}^n (a_{i} \rightarrow y))=1$. So $y\in F$. Therefore $F$ is a Pseudo CI-filter. \end{proof} \end{proposition} \begin{example}\label{4.11} Let $X = \{1, a, b, c, d, e\}$. Define the operations " $\rightarrow $ " and" $\rightsquigarrow$ " on $X$as follows:\\ \vspace{5pt} \begin{center} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} $\rightarrow $ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ $a$ & $a$ & $1$ & $c$ & $c$ & $d$ & $1$ \\ $b$ & $b$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $c$ & $c$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $d$ & $d$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $e$ & $e$ & $a$ & $d$ & $d$ & $d$ & $1$ \\ \end{tabular} \qquad \;\;\;\;\;\;\; \vspace{10pt} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} $\rightsquigarrow $ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ $a$&$a$&$1$&$b$ & $c$ & $d$ & $1$ \\ $b$ & $b$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $c$ & $c$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $d$ & $d$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $e$ & $e$ & $a$ & $c$ & $c$ & $d$ & $1$ \\ \end{tabular} \end{center} \vspace{5pt} Then $(X, \rightarrow, \rightsquigarrow, 1)$ is a pseudo CI-algebra and, \begin{center} $ F(X)=\{\{1\} , \{1, a\}, \{1, b\}, \{1, c\}, \{1, d\}, \{1, e\}, \{1, b, c, d\}, X \}$ \end{center} is the set of pseudo CI-filter of $X$. Also, $(a, b]=X$ and $(b, c]= \{1, b, c, d\}$. \end{example} \begin{proposition}\label{4.12} {\it Let $P$ be a proper filter of $X$. $P$ is a prime pseudo CI-filter of $X$ if and only if $(x]\cap (y] \subseteq P$ implies $x \in P$ or $y\in P$, for all $x, y \in X$.} \begin{proof} $(\Rightarrow)$ Assume that $P$ be a prime pseudo CI-filter of $X$ and $x, y \in X$ such that $(x] \cap (y] \subseteq P$. Since $P$ is a prime CI-fitter, we get $x \in (x] \subseteq P$ or $y \in (y] \subseteq P$. $(\Leftarrow)$ Assume that $F_{1}$ and $F_{2}$ are pseudo CI-filter of $X$ such that $F_{1} \cap F_{2} \subseteq P$. Let $x \in F_{1}$ and $y\in F_{2}$. Hence,$(x] \subseteq F_{1} $ and $(y] \subseteq F_{2}$. Then, $(x]\cap (y] \subseteq F_{1}\cap F_{2} \subseteq P$, and so $x \in P$ or $y\in P$. Thus, $F_{1} \subseteq P$ or $F_{2} \subseteq P$. Therefore, $P$ is a prime pseudo CI-filter of $X$. \end{proof} \end{proposition} \begin{proposition}\label{4.13} {\it Let $F\in F(X)$ and $F\neq X$. Then the following statement are equivalent:\\ $(i)$ $F$ is a Maximal pseudo CI-filter,\\ $(ii)$ If $x \in X$, $x\notin F$ then $(F \cup \{x\}) = X$; for all $x\in X$.}\\ \begin{proof} $(i)\Rightarrow (ii)$. We have $F \subseteq (F \cup \{x\}]$, since $x \notin X$, $F\neq (F \cup \{x\}]$. $F$ is Maximal it follows that $((F \cup \{x\}] = X$.\\ $(ii)\Rightarrow (i)$ Suppose that there is a proper pseudo CI-filter $G$ of $X$ such that $F\subseteq G$. Then there is $x\in G\setminus F$. By $(ii)$, we have $(F \cup \{x\} ] = X$. Since $(F \cup \{x\}] \subseteq G$, it follows that $G = X$. \end{proof} \end{proposition} \begin{proposition}\label{4.14} {\it If $M$ is Maximal pseudo CI-filter of $X$, then $M$ is prime pseudo CI-filter of $X$.} \begin{proof} Let $M$ be Maximal pseudo CI-filter of $X$ and $(x]\cap (y] \subseteq M$, for some $x, y \in X$. Suppose that $x\notin M$ and $y \notin M$. Then,$(M \cup \{x\}] = X $and $(M \cup \{y\}] = X$. Hence, $(M \cup \{x\}]\cap (M \cup \{y\}] = X$ . So, $(x]\cap (y] \nsubseteq M$, which is a contradiction. Then, $x \in M$ or $y\in M$. Therefore, M is prime pseudo CI-filter of $X$. \end{proof} \end{proposition} The following example shows that any prime filter may not be a Maximal filter. \begin{example}\label{4.15} Let $X$ be pseudo CI-algebra in example \eqref{4.2}, (ii). $F_{1}=\{1, a\}$ is a prime pseudo CI-filter, who that not Maximal, because $F_{2}=\{1, a, c\}$ is another pseudo CI-filter and $F_{1}\subseteq F_{2}\neq X$. \end{example} \begin{proposition}\label{4.16} {\it Let $f: X\longrightarrow Y$ be a homomorphism. Then $f$ has the isotonic property, $i. e.$, if $x \leq y$, then $f(x) \leq f(y)$, for all $x, y \in X$.} \begin{proof} If $x \leq y$, Then $x\rightarrow y = x \rightsquigarrow y = 1$. So, $f(x) \rightarrow f(y) = f(x \rightarrow y) = f(1) = 1^{'}$, and $f(x) \rightsquigarrow f(y) = f(x \rightsquigarrow y) = f(1) = 1^{'}$. Hence $f(x) \leq f(y)$. Therefore, $f$ has the isotonic property. \end{proof} \end{proposition} Throughout this section, we assume that $\theta $ be a congruence relations on $X$. \begin{proposition}\label{4.17} {\it Define operations ”$\rightarrow $” and ”$\rightsquigarrow $” on "$X/\theta$" by $C_{x} \rightarrow C_{y} = C_{x \rightarrow y}$ and $C_{x} \rightsquigarrow C_{y} = C_{x \rightsquigarrow y}$. Then $(X/\theta; \rightarrow , \rightsquigarrow , C_{1})$ is a pseudo CI-algebra.} \begin{proof} If $C_{x}, C_{y}, C_{z} \in X/\theta $, then we have:\\ (pCI1) $C_{x} \rightarrow C_{x} = C_{x\rightarrow x} = C_{1}$ and $C_{x} \rightsquigarrow C_{x} = C_{x\rightsquigarrow x} = C_{1}$,\\ (pCI2) $C_{1} \rightarrow C_{x} = C_{1 \rightarrow x} = C_{x}$ and $C_{1} \rightsquigarrow C_{x} = C_{1 \rightsquigarrow x} = C_{x}$,\\ (pCI3) $C_{x} \rightarrow (C_{y} \rightsquigarrow C_{z}) = C_{x} \rightarrow C_{y \rightsquigarrow z} = C_{x \rightarrow (y \rightsquigarrow z)} =\\ C_{y\rightsquigarrow (x\rightarrow z)}= C_{y} \rightsquigarrow C_{x \rightarrow z} = C_{y} \rightsquigarrow ( C_{x} \rightarrow C_{z})$,\\ (pCI4) Since $x\rightarrow y = 1 \Leftrightarrow x\rightsquigarrow y=1$, therefore,\\ $C_{x} \rightarrow C_{y} = C_{x \rightarrow y} = C_{1} \Leftrightarrow C_{x} \rightsquigarrow C_{y} = C_{x \rightsquigarrow y} = C_{1}$. So, $(X/\theta; \rightarrow , \rightsquigarrow , C_{1})$ is a pseudo CI–algebra. \end{proof} \end{proposition} \begin{proposition}\label{4.18} {\it Let $f : X \longrightarrow Y$ be a homomorphism and $\theta = \{(x, y) : f(x) = f(y)\}$. Then:\\ $(i) \ $ $ \ \theta$ is a congruence relation on $X$,\\ $(ii) \ $ $ \ X/\theta \cong f(X)$.} \begin{proof} $(i)$. It is obvious $\theta $ is an equivalence relation on $X$. \\ Assume that $(x, y), \ (u, v) \in \theta$. Then we have $f(x) = f(y)$ and $f(u) = f(v)$. Since $f$ is a homomorphism So, \begin{center} $f(x \rightarrow u) = f(x) \rightarrow f(u) = f(y) \rightarrow f(v) = f(y \rightarrow v)$. \end{center} and \begin{center} $f(x \rightsquigarrow u) = f(x) \rightsquigarrow f(u) = f(y) \rightsquigarrow f(v) = f(y \rightsquigarrow v)$. \end{center} Therefore $(x\rightarrow u, y\rightarrow v),(x\rightsquigarrow u, y\rightsquigarrow v)\in \theta$.\\ In the same way $(u \rightarrow x, v\rightarrow y),(u\rightsquigarrow x, v\rightsquigarrow y) \in \theta$. Hence $\theta$ is a congruence relation on $X$.\\ $(ii)$. Define $\psi : X/\theta \longrightarrow f(X)$ by $\psi (C_{x}) = f(x)$, for all $C_{x} \in X/\theta$. Then $\psi$ is well defined, because if $C_{x} = C_{y}$, for any $x, y \in X$, then $(x, y) \in \theta$. So, $f(x)= f(y)$ and this show $\psi (C_{x}) = \psi (C_{y}) $.\\ Since $Ker \psi = \{C_{x} : \psi(C_{x}) = f(x) = 1\} = \{C_{x} : f(x) = f(1)\} = \{C_{x} : (x, 1) \in \theta\} = C_{1}$. Then $\psi$ is one to one.\\ If $y \in f(X)$ then there are $x \in X$ such that $y= f(x)$. Hence $\psi (C_{x})= f(x) = y $ therefore $\psi$ is onto.\\ Since $\psi (C_{x} \rightarrow C_{y}) = \psi (C_{x\rightarrow y}) = f(x \rightarrow y) = f(x) \rightarrow f(y) = \psi (C_{x}) \rightarrow \psi (C_{y})$ and $\psi (C_{x} \rightsquigarrow C_{y}) = \psi (C_{x\rightsquigarrow y}) = f(x \rightsquigarrow y) = f(x) \rightsquigarrow f(y) = \psi (C_{x}) \rightsquigarrow \psi (C_{y})$. This shows $\psi$ is homomorphism. Therefore, $X/\theta \cong f(X)$. \end{proof} \end{proposition} \begin{example}\label{4.19} Let $X = \{1, a, b, c, d, e\}$. Define the operations " $\rightarrow $ " and" $\rightsquigarrow$ " on $X$as follows:\\ \vspace{5pt} \begin{center} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} $\rightarrow $ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ $a$ & $a$ & $1$ & $c$ & $c$ & $d$ & $1$ \\ $b$ & $b$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $c$ & $c$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $d$ & $d$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $e$ & $e$ & $a$ & $d$ & $d$ & $d$ & $1$ \\ \end{tabular} \qquad \;\;\;\;\;\;\; \vspace{10pt} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{4pt} p{8pt} p{8pt}} $\rightsquigarrow $ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ \hline $1$ & $1$ & $a$ & $b$ & $c$ & $d$ & $e$ \\ $a$&$a$&$1$&$b$ & $c$ & $d$ & $1$ \\ $b$ & $b$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $c$ & $c$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $d$ & $d$ & $a$ & $1$ & $1$ & $1$ & $e$ \\ $e$ & $e$ & $a$ & $c$ & $c$ & $d$ & $1$ \\ \end{tabular} \end{center} \vspace{5pt} Then $(X, \rightarrow, \rightsquigarrow, 1)$ is a pseudo CI-algebra and, \begin{center} $\theta = \triangle \cup \{(b, c), (c, b), (b, d), (d, b), (c, d), (d, c) \}$. \end{center} We can see that $\theta$ is a congruence relation on $X$ and, \begin{center} $X/\theta = \{C_{1} = \{1\}, C_{a} = \{a\}, C_{b}= C_{c}= C_{d}= \{b,c , d\}, C_{e} = \{e \} \}$. \end{center} By following table $(X/\theta, \rightarrow , \rightsquigarrow , C_{1})$ is a pseudo CI-algebra. \begin{center} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{8pt}} $\rightarrow $ & $ C_{1}$ & $ C_{a} $ & $ C_{a} $ & $ C_{a} $ \\ \hline $ C_{1} $ & $ C_{1} $ & $ C_{a} $ & $ C_{b} $ & $ C_{e} $\\ $ C_{a} $ & $ C_{a} $ & $ C_{1} $ & $ C_{b} $ & $ C_{1} $\\ $ C_{b} $ & $ C_{b} $ & $ C_{a} $ & $ C_{1}$ & $ C_{e} $ \\ $ C_{e} $ & $ C_{e} $ & $ C_{a} $ & $ C_{b}$ & $ C_{1} $ \end{tabular} \qquad\;\;\;\;\;\;\;\; \vspace{10pt} \begin{tabular}{p{6pt} |p{4pt} p{4pt} p{4pt} p{8pt}} $\rightsquigarrow$ & $ C_{1}$ & $ C_{a} $ & $ C_{a} $ & $ C_{a} $ \\ \hline $ C_{1} $ & $ C_{1} $ & $ C_{a} $ & $ C_{b} $ & $ C_{e} $\\ $ C_{a} $ & $ C_{a} $ & $ C_{1} $ & $ C_{b} $ & $ C_{1} $\\ $ C_{b} $ & $ C_{b} $ & $ C_{a} $ & $ C_{1}$ & $ C_{e} $ \\ $ C_{e} $ & $ C_{e} $ & $ C_{a} $ & $ C_{b}$ & $ C_{1} $ \end{tabular} \end{center} \end{example} \begin{proposition}\label{4.20} {\it Let $F$ be a pseudo CI-filter in $X$. If we define $ \hat{F}= \{C_{x} : x\in F \}$ ,then $\hat{F}$ is a pseudo CI-filter in $X/\theta $.}\\ \begin{proof} (F1) Since $ 1\in F $, so $ C _{1}\in \hat{F}$.\\ (F2) If $ C_{x} $ and $ C_{x} \rightarrow C_{y} \in \hat{F} $. Since $ C_{x}\rightarrow C_{y}=C_{x\rightarrow y} \in \hat{F}$. Then $x , x\rightarrow y \in F$. $F$ is a pseudo CI-filter, therefore $ y \in F $ so $ C_{y} \in \hat{F}$. \end{proof} \end{proposition} \begin{proposition}\label{4.21} {\it The following statements hold:\\ $(i)$ if $\theta = X \times X$, then $X/\theta = \{C_{1}\}$, \\ $(ii)$ if $\theta = \Delta_{X}$, then $X/\theta = \{X\}$,\\ $(iii)$ if $x \leq y$, then $C_{x} \leq C_{y}$.} \begin{proof} $(i)$. Let $C_{x} \in X/\theta$, for some $x \in X$. Since $\theta = X \times X$, we have $(x, y) \in \theta$ for all $y \in X$. Hence $C_{x} = C_{y}$. Putting $y = 1$, then $C_{x} = C_{1}$. Therefore, $X/\theta = \{C_{1}\}$. $(ii)$. Let $C_{x} \in X/\theta$, for some $x \in X$. Since $\theta = \Delta_{X}$, we have $C_{x} = \{x\}$. Therefore, $X/\theta = \{X\}$. $(iii)$. Since $x \leq y $, we get that $x \rightarrow y = 1$. Hence $ C_{x}\rightarrow C_{y}=C_{x\rightarrow y} = C_{1}$. Therefore, $C_{x} \leq C_{y}$. \end{proof} \end{proposition} {\it A pseudo CI-filter $F$ is called closed pseudo CI-filter of $X$ if $x \rightarrow 1 , x\rightsquigarrow 1 \ \in F$ for all $x \in F$.}\\ From now, for a pseudo CI-filter $F$, let $C_{x} = \{y \in X: \ y \sim _{F} x\}$. Denote $X/F = \{C_{x} : x \in X\}$ and define that $C_{x} \rightarrow C_{y} = C_{x \rightarrow y}$, and $C_{x} \rightsquigarrow C_{y} = C_{x \rightsquigarrow y}$. Since ” $\sim _{F}$ ” is a congruence relation on $X$, the operations ” $\rightarrow $ ” and ” $\rightsquigarrow$ ” are well defined.\\ \begin{proposition}\label{4.22} {\it Let $F$ be a closed pseudo CI-filter of $X$. Then $F = C_{1}$}. \begin{proof} If $x \in F$. $F$ is a closed pseudo CI-filter, then $x \rightarrow 1= 1 \in F$ and $1 \rightarrow x = x \in F$, i.e., $x \sim _{F} 1$. Hence $x \in C_{1}$. Conversely, let $x \in C_{1}$. Then $x = 1 \rightarrow x = 1 \rightsquigarrow x \in F$, and so $x \in F$. Hence $F = C_{1}$. \end{proof} \end{proposition} \begin{proposition}\label{4.23} {\it Let $F$ be a closed pseudo CI-filter of $X$. Then there is a canonical surjective homomorphism $\varphi : X \longrightarrow X/F$ by $\varphi(x) = C_{x}$, and $Ker \varphi = F$, where $Ker \varphi= \varphi^{-1} (C_{1})$}. \begin{proof} It is clear that $\varphi $ is well-defined. Let $x, y \in X$. Then $\varphi(x \rightarrow y) = C_{x\rightarrow y} = C_{x} \rightarrow C_{y} = \varphi(x) \rightarrow \varphi(y)$ and $\varphi(x \rightsquigarrow y) = C_{x\rightsquigarrow y} = C_{x} \rightsquigarrow C_{y} = \varphi(x) \rightsquigarrow \varphi(y)$. Hence $\varphi$ is homomorphism.\\ Clearly $\varphi$ is onto.\\ Also, we have $Ker \varphi = \{x \in X : \varphi(x) = C_{1}\} = \{x \in X : C_{x} = C_{1}\} = \{x \in X : x \rightarrow 1, 1 \rightarrow x, x \rightsquigarrow 1, 1 \rightsquigarrow x \in F\} = \{x \in X : x \in F\} = F$. \end{proof} \end{proposition} \textbf{Conclusion and future work} In this paper, the notion of pseudo CI-filter is defined. The prime, Maximal pseudo CI-filters and generated pseudo CI-filters by one set is the are another purpose aim of this paper. In this article, the pseudo upper set of two elements is introduced and its relationship with pseudo CI-filters is examined and it is proved that each pseudo CI-filter is the union of the pseudo upper sets. Also, the congruence relation, transitive CI-algebra has been introduced and the relationships between pseudo CI-filters and compatibility relationship have been investigated. In a transitive CI-algebra we created a congruence relation with a pseudo CI-filters, and applied the concept of congruence relations to pseudo CI–algebras and discuss the quotient algebras via this congruence relations. We introduce homomorphism between two CI-algebra and prove that each homomorphic image (under certain conditions) and preimage of a pseudo CI-filter is also a pseudo CI-filter. In the future work, We intend to define the concept of fuzzy pseudo CI-filters and intuitionistic fuzzy CI-filters on pseudo CI-algebras. in pseudo CI-algebras, and Other types of filters are defined in pseudo CI-algebras and the relationship between them is discussed. \textbf{Acknowledgment} The authors wish to express their sincere thanks to the referees for the valuable suggestions which lead to an improvement of this paper. \begin{center} \begin{thebibliography}{99} \bibitem{Ahn}\label{Ahn} S.S. Ahn and Y.H. So, On ideals and upper sets in BE-algebras, {\it Sci. Math. Jpn}, 68 (2008), 279--285. \bibitem{Kim}\label{Kim} S.S. Ahn, Y.H. Kim and J.M. Ko, Filters in commutative BE-algebras,{\it Commun Korean Math Soc}, 27(2), (2012), 233–-242. \bibitem{Borumand}\label{Borumand} A. Borumand Saeid, A. Rezaei and R.A. Borzoei, Some types of filters in BE-algebras, {\it math, comput. Sci}, 7(3), (2013), 341--352. \bibitem{Borzooei}\label{Borzooei} R.A. Borzooei, A. Bolumand Saeid, A. Rezaei, A. Radfar and R. Ameri, On pseudo-BE argebras, {\it Discuss Math Gen Algebra Appl}, 33, (2013), 95-- 108. \bibitem{Saeid}\label{Saeid} R.A. Borzooei, A. Borumand Saeid, A. Rezaei, A. Radfar and R. Ameri, Distributive pseudo BE-algebras, {\it Fasciculi Mathematici}, 54 (2015), 21--39. \bibitem{Dudek}\label{Dudek} W.A.Dudek and Y.B. Jun, Pseudo-BCI algebras, {\it East Asian Math.J}, 24(2), (2008), 187--190. \bibitem{Dymak}\label{Dymak} G. Dymek, P-semisimple pseudo BCI-algebras, {\it J Mult Valued Logic Soft Comput}, 19, (2012), 461--474. \bibitem{Georgescu}\label{Georgescu} G. Georgescu and A. Iorgulescu, Pseudo BCK-algebras, {\it in: Proc. DMTS, Com- binatorcs, Computability and Logics, Springer, London}, 1, (2001), 97--114. \bibitem{Hu}\label{Hu} Q.P. Hu and X. Li, On BCH-algebras, {\it Math. Semin. Notes} 11, (1983), 313--320. \bibitem{Imai}\label{Imai} Y. Imai and K. Is\'{e}ki, On axiom systems of propositional Calculi, {\it XIV proc. Jpn. Academy} 42, (1966) 19--22. \bibitem{Iski}\label{Iski} K. Is\'{e}ki, An algebra related with a propositional calculus, {\it Proc. Jpn. Acad}, 42, (1966), 26--29. \bibitem{Jun}\label{Jun} Y. B. Jun, H. S. Kim and J. Neggers, On pseudo d-algebras, {\it Inform. Sci.}, 179, (2009), 1751--1759. \bibitem{Bee}\label{Bee} J.Y. Jun, H.S. Kim and S.S. Ahn, Structures of pseudo ideal and pseudo atom in a pseudo Q-algebra, {\it Kyungpook Math. J.} 56(1), (2016), 95--106. \bibitem{Kim}\label{Kim} H.S. Kim and Y.H. Kim, on BE-algebras, {\it sci. Math. Jpn.}, 66, (2007), 113--116. \bibitem{LMeng}\label{LMeng} B. L. Meng, CI-algebras, {\it Sci Math Japon}, 71(1), (2010), 11--17. \bibitem{Meng}\label{Meng} B.L. Meng, On filters in BE-algebras, {\it Sci. Math. Jpn.}, 71, (2010), 201--207. \bibitem{Mundici}\label{Mundici} D. Mundici, MV-algebras are categorically equivalent to bounded commutative BCK- algebras, {\it Math. Japon.}, 31, (1986), 889--894. \bibitem{Neggers}\label{Neggers} J. Neggers, S. S. Ahn and H. S. Kim, On Q-algebras, {\it Inter. J. Math and Math. Sci.}, 27, (2001), 749--757. \bibitem{Rezaei}\label{Rezaei} A. Rezaei, A. Borumand Saeid and A. Yousefi Sikari Saber. On pseudo-CI algebras, {\it Soft Comput}, 23(13), (2019), 4643--4654. \bibitem{Radfar}\label{Radfar} A. Rezaei, A. Borumand Saeid, A. Radfar and RA. Borzooei, Congruence relations on preudo BE-algebras, {\it Ann Univ Craiova Math Comput Sci Ser}, 41(2), (2014), 166--176. \bibitem{Walendzias}\label{Walendzias} A. Walendzias, Pseudo BCH-algebras, {\it Discuss Math Gen Algebra Appl}, 35, (2015), 5--19. \bibitem{Walendziak}\label{Walendziak} A. Walendziak, On commutative BE-algebras, {\it Sci Math Jpn}, 69(2), (2008), 585–-588. \end{thebibliography} \end{center} {\small \noindent{\bf Neda Shojaei} \noindent{Graduated Ph.D of Mathematics} \noindent Department of Mathematics \noindent Islamic Azad University, Kerman Branch \noindent Kerman, Iran \noindent E-mail: n.shojaee64@yahoo.com}\\ {\small \noindent{\bf Arsham Borumand Saeid } \noindent Professor of Mathematics \noindent Department of Pure Mathematics, \noindent Faculty of Mathematics and Computer, \noindent Shahid Bahonar University of Kerman \noindent Kerman, Iran \noindent E-mail: arsham@uk.ac.ir}\\ \end{document}