Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Modal logic
AI challenges in iris recognition. processing tools for bath iris image database
ICAI'10 Proceedings of the 11th WSEAS international conference on Automation & information
Hi-index | 0.01 |
This paper presents a formal theory which describes propositional binary logic as a semantically closed formal language, and allows for syntactically and semantically well-formed formulae, formal proofs (demonstrability in Hilbertian acception), deduction (Gentzen's view of demonstrability), CNF-ization, and deconstruction to be expressed and tested in the same (computational) formal language, using the same data structure. It is also shown here that Cognitive Binary Logic is a self-described theory in which the Liar Paradox is deconstructed.