Semi-algebra and Algebra of Sets

Author(s):  
Stefano Gentili
Keyword(s):  
2015 ◽  
Vol 23 (1) ◽  
pp. 51-57 ◽  
Author(s):  
Noboru Endou ◽  
Kazuhisa Nakasho ◽  
Yasunari Shidama

Summary In this article, semiring and semialgebra of sets are formalized so as to construct a measure of a given set in the next step. Although a semiring of sets has already been formalized in [13], that is, strictly speaking, a definition of a quasi semiring of sets suggested in the last few decades [15]. We adopt a classical definition of a semiring of sets here to avoid such a confusion. Ring of sets and algebra of sets have been formalized as non empty preboolean set [23] and field of subsets [18], respectively. In the second section, definitions of a ring and a σ-ring of sets, which are based on a semiring and a ring of sets respectively, are formalized and their related theorems are proved. In the third section, definitions of an algebra and a σ-algebra of sets, which are based on a semialgebra and an algebra of sets respectively, are formalized and their related theorems are proved. In the last section, mutual relationships between σ-ring and σ-algebra of sets are formalized and some related examples are given. The formalization is based on [15], and also referred to [9] and [16].


This chapter describes implementation of abductive and modified conclusions by means of NTA. The algorithm and rules to form hypotheses for abductive conclusions are proposed. They can be applied not only to NTA objects expressing formulas of propositional calculus, but also to a more general case when attribute domains contain more than two values. Within a specific knowledge system, choosing variables and their values depends on criteria determined by the content of the system. The techniques that we developed simplify generating abductive conclusions for given limitations, for instance, in composition and number of variables. A distinctive feature of the proposed methods is that they are based on the classical foundations of logic, that is, they do not use non-monotonic logic, the logic of defaults, etc., which allowed some violations of laws of Boolean algebra and algebra of sets.


This chapter presents some conventional means of logical analysis. It is necessary to show the scope and features of our approach. In particular, we refer to algebra of sets and algebra of logic (propositional algebra), which belong to the class of Boolean algebras, as well as partially ordered sets and the theory of relations.


2021 ◽  
Vol 128 (1) ◽  
pp. 25-39
Author(s):  
Joshua P. Bowman
Keyword(s):  

2015 ◽  
Vol 108 (9) ◽  
pp. 720
Author(s):  
Katie A. Hendrickson ◽  
Gabrielle Kisner

Problem-based learning motivates students to use their knowledge of geometry and algebra.


1988 ◽  
Vol 37 (1-3) ◽  
pp. 37-60 ◽  
Author(s):  
Dennis S. Arnon

Sign in / Sign up

Export Citation Format

Share Document