On fuzzy positive implicative filters in BE-algebras.
Ontology highlight
ABSTRACT:
SUBMITTER: Ahn SS
PROVIDER: S-EPMC4058197 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Some new properties of fuzzy associative filters (also known as fuzzy associative pseudo-filters), fuzzy p-filter (also known as fuzzy pseudo-p-filters), and fuzzy a-filter (also known as fuzzy pseudo-a-filters) in pseudo-BCI algebras are investigated. By these properties, the following important results are proved: (1) a fuzzy filter (also known as fuzzy pseudo-filters) of a pseudo-BCI algebra is a fuzzy associative filter if and only if it is a fuzzy a-filter; (2) a filter (also known as pseudo-filter) of a pseudo-BCI algebra is associative if and only if it is an a-filter (also call it pseudo-a filter); (3) a fuzzy filter of a pseudo-BCI algebra is fuzzy a-filter if and only if it is both a fuzzy p-filter and a fuzzy q-filter.
| S-EPMC4000979 | biostudies-other
Project description:The notions of an ideal and a fuzzy ideal in BN-algebras are introduced. The properties and characterizations of them are investigated. The concepts of normal ideals and normal congruences of a BN-algebra are also studied, the properties of them are displayed, and a one-to-one correspondence between them is presented. Conditions for a fuzzy set to be a fuzzy ideal are given. The relationships between ideals and fuzzy ideals of a BN-algebra are established. The homomorphic properties of fuzzy ideals of a BN-algebra are provided. Finally, characterizations of Noetherian BN-algebras and Artinian BN-algebras via fuzzy ideals are obtained.
| S-EPMC4466498 | biostudies-other
Project description:In this paper we investigate further properties of fuzzy ideals of a BL-algebra. The notions of fuzzy prime ideals, fuzzy irreducible ideals, and fuzzy Gödel ideals of a BL-algebra are introduced and their several properties are investigated. We give a procedure to generate a fuzzy ideal by a fuzzy set. We prove that every fuzzy irreducible ideal is a fuzzy prime ideal but a fuzzy prime ideal may not be a fuzzy irreducible ideal and prove that a fuzzy prime ideal ω is a fuzzy irreducible ideal if and only if ω(0) = 1 and |Im(ω)| = 2. We give the Krull-Stone representation theorem of fuzzy ideals in BL-algebras. Furthermore, we prove that the lattice of all fuzzy ideals of a BL-algebra is a complete distributive lattice. Finally, it is proved that every fuzzy Boolean ideal is a fuzzy Gödel ideal, but the converse implication is not true.
| S-EPMC4032761 | biostudies-other
Project description:The most simplified axiom systems of pseudo-weak-R0 algebras and pseudo-R0 algebras are obtained, and the mutually independence of axioms is proved. We introduce the notions of filters and normal filters in pseudo-weak-R0 algebras. The structures and properties of the generated filters and generated normal filters in pseudo-weak-R0 algebras are obtained. These can be seen as noncommutative generalizations of the corresponding ones in weak-R0 algebras.
| S-EPMC4119676 | biostudies-other
Project description:As a link between classical soft sets and hesitant fuzzy sets, the notion of hesitant fuzzy soft sets is introduced and applied to a decision making problem in the papers by Babitha and John (2013) and Wang et al. (2014). The aim of this paper is to apply hesitant fuzzy soft set for dealing with several kinds of theories in BCK/BCI-algebras. The notions of hesitant fuzzy soft subalgebras and (closed) hesitant fuzzy soft ideals are introduced, and related properties are investigated. Relations between a hesitant fuzzy soft subalgebra and a (closed) hesitant fuzzy soft ideal are discussed. Conditions for a hesitant fuzzy soft set to be a hesitant fuzzy soft subalgebra are given, and conditions for a hesitant fuzzy soft subalgebra to be a hesitant fuzzy soft ideal are provided. Characterizations of a (closed) hesitant fuzzy soft ideal are considered.
| S-EPMC4212623 | biostudies-other
Project description:We give the simple general principle of studying the relations among fuzzy t-filters on residuated lattices. Using the general principle, we can easily determine the relations among fuzzy t-filters on different logical algebras.
| S-EPMC4217329 | biostudies-other
Project description:BackgroundHelmet continuous positive airway pressure (CPAP) has been widely used during the COVID-19 pandemic. Specific filters (i.e. High Efficiency Particulate Air filter: HEPA; Heat & Moisture Exchanger Filter: HMEF) were used to prevent Sars-CoV2 environmental dispersion and were connected to the CPAP helmet. However, HEPA and HMEF filters may act as resistors to expiratory gas flow and increase the levels of pressure within the hood.MethodsIn a bench-top study, we investigated the levels of airway pressure generated by different HEPA and HMEF filters connected to the CPAP helmet in the absence of a Positive End Expiratory Pressure (PEEP) valve and with two levels of PEEP (5 and 10 cmH2O). All steps were performed using 3 increasing levels of gas flow (60, 80, 100 L/min).ResultsThe use of 8 different commercially available filters significantly increased the pressure within the hood of the CPAP helmet with or without the use of PEEP valves. On average, the increase of pressure above the set PEEP ranged from 3 cmH2O to 10 cmH2O across gas flow rates of 60 to 100 L/min. The measure of airway pressure was highly correlated between the laboratory pressure transducer and the Helmet manometer. Bias with 95% Confidence Interval of Bias between the devices was 0.7 (-2.06; 0.66) cmH2O.ConclusionsThe use of HEPA and HMEF filters placed before the PEEP valve at the expiratory port of the CPAP helmet significantly increase the levels of airway pressure compared to the set level of PEEP. The manometer can detect accurately the airway pressure in the presence of HEPA and HMEF filters in the helmet CPAP and its use should considered.
| S-EPMC9252871 | biostudies-literature
Project description:Human cognitive capacity includes recursively definable concepts, which are prevalent in domains involving lists, numbers, and languages. Cognitive science currently lacks a satisfactory explanation for the systematic nature of such capacities (i.e., why the capacity for some recursive cognitive abilities-e.g., finding the smallest number in a list-implies the capacity for certain others-finding the largest number, given knowledge of number order). The category-theoretic constructs of initial F-algebra, catamorphism, and their duals, final coalgebra and anamorphism provide a formal, systematic treatment of recursion in computer science. Here, we use this formalism to explain the systematicity of recursive cognitive capacities without ad hoc assumptions (i.e., to the same explanatory standard used in our account of systematicity for non-recursive capacities). The presence of an initial algebra/final coalgebra explains systematicity because all recursive cognitive capacities, in the domain of interest, factor through (are composed of) the same component process. Moreover, this factorization is unique, hence no further (ad hoc) assumptions are required to establish the intrinsic connection between members of a group of systematically-related capacities. This formulation also provides a new perspective on the relationship between recursive cognitive capacities. In particular, the link between number and language does not depend on recursion, as such, but on the underlying functor on which the group of recursive capacities is based. Thus, many species (and infants) can employ recursive processes without having a full-blown capacity for number and language.
| S-EPMC3325926 | biostudies-literature