Author: LAVINIA CORINA CIUNGU
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 21
Get Book Here
Book Description
In this paper we introduce the very true operators on pseudo-BCK algebras and we study their properties. We prove that the composition of two very true operators is a very true operator if and only if they commute.
Author: Yong Liu
Publisher: Springer Nature
ISBN: 3030324567
Category : Technology & Engineering
Languages : en
Pages : 1009
Get Book Here
Book Description
This book discusses the recent advances in natural computation, fuzzy systems and knowledge discovery. Presenting selected, peer-reviewed papers from the 15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD 2019), held in Kunming, China, from 20 to 22 July 2019, it is a useful resource for researchers, including professors and graduate students, as well as R&D staff in industry.
Author: Lavinia Corina Ciungu
Publisher: Springer Science & Business Media
ISBN: 3319015893
Category : Mathematics
Languages : en
Pages : 284
Get Book Here
Book Description
This monograph provides a self-contained and easy-to-read introduction to non-commutative multiple-valued logic algebras; a subject which has attracted much interest in the past few years because of its impact on information science, artificial intelligence and other subjects. A study of the newest results in the field, the monograph includes treatment of pseudo-BCK algebras, pseudo-hoops, residuated lattices, bounded divisible residuated lattices, pseudo-MTL algebras, pseudo-BL algebras and pseudo-MV algebras. It provides a fresh perspective on new trends in logic and algebras in that algebraic structures can be developed into fuzzy logics which connect quantum mechanics, mathematical logic, probability theory, algebra and soft computing. Written in a clear, concise and direct manner, Non-Commutative Multiple-Valued Logic Algebras will be of interest to masters and PhD students, as well as researchers in mathematical logic and theoretical computer science.
Author: Sambasiva Rao Mukkamala
Publisher: Springer
ISBN: 9811068380
Category : Mathematics
Languages : en
Pages : 452
Get Book Here
Book Description
This book presents a unified course in BE-algebras with a comprehensive introduction, general theoretical basis and several examples. It introduces the general theoretical basis of BE-algebras, adopting a credible style to offer students a conceptual understanding of the subject. BE-algebras are important tools for certain investigations in algebraic logic, because they can be considered as fragments of any propositional logic containing a logical connective implication and the constant "1", which is considered as the logical value “true”. Primarily aimed at graduate and postgraduate students of mathematics, it also helps researchers and mathematicians to build a strong foundation in applied abstract algebra. Presenting insights into some of the abstract thinking that constitutes modern abstract algebra, it provides a transition from elementary topics to advanced topics in BE-algebras. With abundant examples and exercises arranged after each section, it offers readers a comprehensive, easy-to-follow introduction to this field.
Author: C.S. Calude
Publisher: Springer Science & Business Media
ISBN: 1447107179
Category : Mathematics
Languages : en
Pages : 254
Get Book Here
Book Description
This volume contains the papers presented at the Third Discrete Mathematics and Theoretical Computer Science Conference (DMTCS1), which was held at 'Ovidius'University Constantza, Romania in July 2001. The conference was open to all areas of discrete mathematics and theoretical computer science, and the papers contained within this volume cover topics such as: abstract data types and specifications; algorithms and data structures; automata and formal languages; computability, complexity and constructive mathematics; discrete mathematics, combinatorial computing and category theory; logic, nonmonotonic logic and hybrid systems; molecular computing.
Author: Anatolij Dvurecenskij
Publisher: Springer Science & Business Media
ISBN: 9401724229
Category : Mathematics
Languages : en
Pages : 551
Get Book Here
Book Description
D. Hilbert, in his famous program, formulated many open mathematical problems which were stimulating for the development of mathematics and a fruitful source of very deep and fundamental ideas. During the whole 20th century, mathematicians and specialists in other fields have been solving problems which can be traced back to Hilbert's program, and today there are many basic results stimulated by this program. It is sure that even at the beginning of the third millennium, mathematicians will still have much to do. One of his most interesting ideas, lying between mathematics and physics, is his sixth problem: To find a few physical axioms which, similar to the axioms of geometry, can describe a theory for a class of physical events that is as large as possible. We try to present some ideas inspired by Hilbert's sixth problem and give some partial results which may contribute to its solution. In the Thirties the situation in both physics and mathematics was very interesting. A.N. Kolmogorov published his fundamental work Grundbegriffe der Wahrschein lichkeitsrechnung in which he, for the first time, axiomatized modern probability theory. From the mathematical point of view, in Kolmogorov's model, the set L of ex perimentally verifiable events forms a Boolean a-algebra and, by the Loomis-Sikorski theorem, roughly speaking can be represented by a a-algebra S of subsets of some non-void set n.
Author: Angel Garrido
Publisher: MDPI
ISBN: 3039281909
Category : Mathematics
Languages : en
Pages : 458
Get Book Here
Book Description
Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.
Author: LAVINIA CORINA CIUNGU
Author: Florentin Smarandache
Author: Florentin Smarandache
Author: Jie Meng