Boolean Logic, Expressions and Theories: An Overview


Victoria C. Carlsen (Editor)

Series: Theoretical and Applied Mathematics
BISAC: MAT002000

The Boolean function network is a systematical approach proposed for the inference of gene regulatory networks and related Boolean functions. This procedure utilizes two steps to integrate the hidden Markov model, likelihood ratio test and Boolean functions for discovering direct pairwise relations between genes from time-course transcriptome data. In this compilation, the authors justify the need for this novel approach and describe the inference procedure.

Next, an extended Boolean logic is introduced, denoted by LLT, called “star-finite” or “hyperfinite” logic. LLT is closely related to infinitary logics, which have been investigated extensively.

Lastly, generalized Boolean functions are introduced, and an overview with regard to constructions
of Golay complementary sequences from generalized Boolean functions is given.
(Imprint: Nova)



Table of Contents


Chapter 1. Boolean Function Networks
(Maria Simak, Henry Horng-Shing Lu, Chen-Hsiang Yeang and Jinn-Moon Yang, Institute of Bioinformatics and Systems Biology, National Chiao Tung University, Hsinchu, Taiwan, ROC, Institute of Statistics, National Chiao Tung University, Hsinchu, Taiwan, ROC, and Institute of Statistics, Academia Sinica, Taipei, Taiwan, ROC)

Chapter 2. Star-Finite Logics and Their Algebraizations
(Miklós Ferenczi, Department of Algebra, Budapest University of Technology, Budapest)

Chapter 3. Generalized Boolean Functions and Their Applications to Communications
(Fanxin Zeng, Yue Zeng, Guojun Li, Lisheng Zhang and Changrong Ye, Laboratory of Beyond LOS Reliable Information Transmission, Chongqing University of Posts and Telecommunications, Chongqing, China)


Additional information