Proof of Majority Voting Algorithm In Constructive Mathematics 'Source Title' Mehran University Research Journal of Engineering and Technology Volume Vol.10, No.1
Bibliographic details
Summary
Constructive mathematics is characterised by the requirement that a propostion A is neither true nor false unless it or its negation has been constructively proven. In concrete terms, constructive mathematics denies the validity of the law of excluded middle ( A or Not A = true) and all its consequences. In this paper our objective is to develop proof of majority voting algorithm in constructive mathematics by illustrating the identification and decomposition of propositions.