Majority Logic
نویسندگان
چکیده
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness proofs. Along the way, we must answer the question what is a majority of an infinite set? Majority spaces are introduced as a solution to this question.
منابع مشابه
Optimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملDesigning a Meta-Heuristic Algorithm Based on a Simple Seeking Logic
Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...
متن کاملMajority Logic Coding and its Multinomial Representation
Multinomial representations are derived for majority logic operations on bipolar binary data. The coefficients are given simply in terms of the readily computed lower Cholesky factor of Pascal Matrices of order n for codes of block length n. Sufficient conditions on majority logic codes having no deterministic errors introduced in the majority logic coding and majority logic decoding process ar...
متن کاملError Detection in Majority Logic Decoding Using Euclidean Geometry Low Density Parity Check (eg-ldpc) Codes
In a recent paper, a method was proposed to accelerate the majority logic decoding of difference set low density parity check codes. This is useful as majority logic decoding can be implemented serially with simple hardware but requires a large decoding time. In this brief, we study the application of a similar technique to a class of Euclidean geometry low density parity check (EGLDPC) codes t...
متن کاملA Sound and Complete Axiomatization of Majority-n Logic
Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional synthesis tools. Also, the Boolean satisfiability problem finds new solution approaches when described in terms of majority decisions. To support computer logic applic...
متن کامل