Welcome to the InfoSci Platform
Bipolar Quantum Lattice and Dynamic Triangular Norms

Bipolar Quantum Lattice and Dynamic Triangular Norms

Copyright: © 2011 |Pages: 32
ISBN13: 9781609605254|ISBN10: 160960525X|EISBN13: 9781609605261
DOI: 10.4018/978-1-60960-525-4.ch004
Cite Chapter Cite Chapter

MLA

Wen-Ran Zhang. "Bipolar Quantum Lattice and Dynamic Triangular Norms." YinYang Bipolar Relativity: A Unifying Theory of Nature, Agents and Causality with Applications in Quantum Computing, Cognitive Informatics and Life Sciences, IGI Global, 2011, pp.97-128. https://doi.org/10.4018/978-1-60960-525-4.ch004

APA

W. Zhang (2011). Bipolar Quantum Lattice and Dynamic Triangular Norms. IGI Global. https://doi.org/10.4018/978-1-60960-525-4.ch004

Chicago

Wen-Ran Zhang. "Bipolar Quantum Lattice and Dynamic Triangular Norms." In YinYang Bipolar Relativity: A Unifying Theory of Nature, Agents and Causality with Applications in Quantum Computing, Cognitive Informatics and Life Sciences. Hershey, PA: IGI Global, 2011. https://doi.org/10.4018/978-1-60960-525-4.ch004

Export Reference

Mendeley
Favorite

Abstract

Bipolar quantum lattice (BQL) and dynamic triangular norms (t-norms) are presented in this chapter. BQLs are defined as special types of bipolar partially ordered sets or posets. It is shown that bipolar quantum entanglement is definable on BQLs. With the addition of fuzziness, BDL is extended to a bipolar dynamic fuzzy logic (BDFL). The essential part of BDFL consists of bipolar dynamic triangular norms (t-norms) and their co-norms which extend their truth-based counterparts from a static unipolar fuzzy lattice to a bipolar dynamic quantum lattice. BDFL has the advantage in dealing with uncertainties in bipolar dynamic environments. With bipolar quantum lattices (crisp or fuzzy), the concepts of bipolar symmetry and quasi-symmetry are defined which form a basis toward a logically complete quantum theory. The concepts of strict bipolarity, linearity, and integrity of BQLs are introduced. A recovery theorem is presented for the depolarization of any strict BQL to Boolean logic. The recovery theorem reinforces the computability of BDL or BDFL.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.