double stone algebra
Recently Published Documents


TOTAL DOCUMENTS

5
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2018 ◽  
Vol 11 (06) ◽  
pp. 1850083
Author(s):  
A. R. J. Srikanth ◽  
R. V. G. Ravi Kumar

A regular double Stone algebra with nonvoid core is called core regular double Stone algebra (CRDSA) [6] and this particular core element affects the behavior of the algebra in certain aspects especially in characterization of maximal and prime ideals. In this paper, an elegant characterization for maximal and prime ideals of a CRDSA is established.


Author(s):  
Jianhua Dai

The collection of the rough set pairs <lower approximation, upper approximation> of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough algebras, including rough Stone algebras, Stone algebras, rough double Stone algebras, and regular double Stone algebras are proposed in this paper. The sequent calculi are called rough Stone logic (RSL), Stone logic (SL), rough double Stone logic (RDSL), and double Stone Logic (DSL). The languages, axioms and rules are presented. The soundness and completeness of the logics are proved.


Author(s):  
Jianhua Dai

The collection of the rough set pairs <lower approximation, upper approximation> of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough algebras, including rough Stone algebras, Stone algebras, rough double Stone algebras, and regular double Stone algebras are proposed in this paper. The sequent calculi are called rough Stone logic (RSL), Stone logic (SL), rough double Stone logic (RDSL), and double Stone Logic (DSL). The languages, axioms and rules are presented. The soundness and completeness of the logics are proved.


1981 ◽  
Vol 24 (1) ◽  
pp. 133-147 ◽  
Author(s):  
Ivo Düntsch

We prove that a regular double Stone algebra is protective in the category of Stone algebras if and only if its centre is a projective Boolean algebra and its dense set is countably generated as a filter. It follows that every countable regular double Stone algebra is projective as a Stone algebra.


Sign in / Sign up

Export Citation Format

Share Document