Scopul nostru este sprijinirea şi promovarea cercetării ştiinţifice şi facilitarea comunicării între cercetătorii români din întreaga lume.
Autori: N. Popescu-Bodorin, L. State
Editorial: WSEAS Press, Proc. 4th WSEAS International Conference on Computational Intelligence, p.135-142, 2010.
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.
Cuvinte cheie: cognitive binary logic, liar paradox, cognitive implication, propositional binary logic, tertium non datur, CBL, CCBL, SCBL // cognitive binary logic, liar paradox, cognitive implication, propositional binary logic, tertium non datur, CBL, CCBL, SCBL