1. Agudelo, J.C., Carnielli, W.A.: Quantum algorithms, paraconsistent computa-tion and Deutsch’s problem. In Bhanu Prasad et al., eds.: Proceedings of the 2nd Indian International Conference on Artificial Intelligence, Pune, India, December 20-22 (2005) IICAI 2005, 1609-1628. Pre-print available from CLE e-Prints vol. 5(10) (2005) ftp://logica.cle.unicamp.br/pub/e-prints/MTPs-CompQuant%28Ing%29.pdf
2. Ahmed, T.S.: Algebraic logic, where does it stand today? Bull. Symbolic Logic 11(4) (2005) 465-516
3. Beame, P., Impagliazzo, R., Krajicek, J., T. Pitassi, T., Pudlak, P.: Lower bounds on Hilbert’s Nullstellensatz and propositional proofs. Proceedings of the London Mathematical Society 73 (1996) 1-26
4. Boole, G.: The Mathematical Analysis of Logic, Being an Essay Towards a Calculus of Deductive Reasoning. Macmillan, Barclay and Macmillan, London (1847) (Reprinted by Basil Blackwell, Oxford, 1965)
5. Boole, G.: The calculus of logic. Cambridge and Dublin Math. Journal 3 (1848) 183-198