The Robbins problem: Computer proofs and human proofs

Kybernetes

Volumn 30, Issue 5-6, 2001, Pages 726-752

  Kauffman, Louis H ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Communications; Computers; Cybernetics; Language

Indexed keywords

ALGEBRA; COMMUNICATION; COMPUTERS; CYBERNETICS;

COMPUTER PROOFS; HUMAN BEING; LANGUAGE; ROBBINS CONJECTURES;

BOOLEAN ALGEBRA;

EID: 0035619382     PISSN: 0368492X     EISSN: None     Source Type: Journal    
DOI: 10.1108/EUM0000000005698     Document Type: Article

References (9)

1. Boole, G. (1847), The Mathematical Analysis of Logic, Cambridge.
2. Huntington, E.V. (1933), “Boolean algebra: a correction”, Trans. Amer. Math. Soc., Vol. 35, pp. 557-8.
3. Kauffman, L.H. (1990), “Robbins algebra”, Proceedings of the 20th International Symposium on Multiple Valued Logic, IEE Computer Society Press, pp. 54-60.
4. Kauffman, L.H. (1997), “Column on virtual logic”, Cybernetics and Human Knowing, Vol. 4 No. 1, pp. 105-9.
5. Ketner, K.L. (1990), Elements of Logic – An Introduction to Peirce’s Existential Graphs, Texas University Press.
6. Peirce, C.S. (1992), “Reasoning and the logic of things”, in Ketner, K.L. (Ed.), The Cambridge Conferences Lectures of 1898, Harvard University Press, Cambridge, MA and London.
7. Shannon, C.E. (1938), “A symbolic analysis of relay and switching circuits”, Trans. Am. Inst. Elec. Eng., Vol. 57, pp. 713-23.
8. Spencer-Brown, G. (1969), Laws of Form, Allen & Unwin, London.
9. Winker, S. (1992), “Absorbtion and idempotency criteria for a problem in near-Boolean algebras”, Journal of Algebra, Vol. 153, pp. 414-23.