The Robbins problem: computer proofs and human proofs

DOI10.1108/EUM0000000005698MaRDI QIDQ2746807zbMATH OpenFDO

Authors Louis Kauffman

Publication date 2 July 2002

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/EUM0000000005698

zbMATH Keywords

Boolean algebraRobbins problem

Mathematics Subject Classification ID

Recommendations

• The Kreisel length-of-proof problem
• Proof Complexity and the Kneser-Lovász Theorem
• On a proof of Robbins-Monro algorithm
• On a Problem of Robbins
• Eliminating human insight: An algorithmic proof of Stembridge's TSPP theorem
• scientific article; zbMATH DE number 3978381
• Computer-aided proofs of Arrow's and other impossibility theorems
• The computational content of arithmetical proofs

Cites work

• Absorption and idempotency criteria for a problem in near-Boolean algebras
• scientific article; zbMATH DE number 3062907 (Why is no real title available?)

Cited in

(6)

• Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem
• Robbins algebras vs. Boolean algebras
• Well-behaved search and the Robbins problem
• EigenForm
• Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors
• Artificial intelligence and inherent mathematical difficulty

This page was built for publication: The Robbins problem: computer proofs and human proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746807)