Open AccessAn Essay on Complex Valued Propositional Logic
Author(s) -
Vassil Sgurev
Publication year - 2013
Publication title -
information technologies and control
Language(s) - English
Resource type - Journals
eISSN - 2367-5357
pISSN - 1312-2622
DOI - 10.2478/itc-2013-0001
Subject(s) - propositional variable , mathematics , propositional calculus , modus ponens , zeroth order logic , truth function , non classical logic , truth table , well formed formula , tautology (logic) , propositional formula , negation , logical connective , classical logic , axiom , rule of inference , intuitionistic logic , conjunction (astronomy) , algebra over a field , logical equivalence , discrete mathematics , intermediate logic , equivalence (formal languages) , inference , pure mathematics , logical consequence , algorithm , computer science , artificial intelligence , description logic , multimodal logic , geometry , physics , astronomy , programming language
In decision making logic it is often necessary to solve logical equations for which, due to the features of disjunction and conjunction, no admissible solutions exist. In this paper an approach is suggested, in which by the introduction of Imaginary Logical Variables (ILV), the classical propositional logic is extended to a complex one. This provides a possibility to solve a large class of logical equations.The real and imaginary variables each satisfy the axioms of Boolean algebra and of the lattice. It is shown that the Complex Logical Variables (CLV) observe the requirements of Boolean algebra and the lattice axioms. Suitable definitions are found for these variables for the operations of disjunction, conjunction, and negation. A series of results are obtained, including also the truth tables of the operations disjunction, conjunction, negation, implication, and equivalence for complex variables. Inference rules are deduced for them analogous to Modus Ponens and Modus Tollens in the classical propositional logic. Values of the complex variables are obtained, corresponding to TRUE (T) and FALSE (F) in the classic propositional logic. A conclusion may be made from the initial assumptions and the results achieved, that the imaginary logical variable i introduced hereby is “truer” than condition “T” of the classic propositional logic and i - “falser” than condition “F”, respectively. Possibilities for further investigations of this class of complex logical structures are pointed out