Felix Arends, Joël Ouaknine & Charles W Wampler (2011):
On searching for Small Kochen-Specker Vector Systems.
In: Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science.
Springer-Verlag,
pp. 23–34,
doi:10.1007/978-3-642-25870-1_4.
Adán Cabello (2000):
Kochen–Specker theorem and experimental test on hidden variables.
International Journal of Modern Physics A 15(18),
pp. 2813–2820,
doi:10.1016/S0217-751X(00)00202-9.
George E Collins (1998):
Quantifier elimination for real closed fields by cylindrical algebraic decomposition.
In: Quantifier elimination and cylindrical algebraic decomposition.
Springer,
pp. 85–121,
doi:10.1007/978-3-7091-9459-1_2.
John H Conway & Simon Kochen (2009):
The strong free will theorem.
Notices of the AMS 56(2),
pp. 226–232.
Andreas Dolzmann & Thomas Sturm (1997):
Redlog: Computer algebra meets computer logic.
Acm Sigsam Bulletin 31(2),
pp. 2–9,
doi:10.1145/261320.261324.
Simon Kochen & EP Specker (1975):
The problem of hidden variables in quantum mechanics.
In: The Logico-Algebraic Approach to Quantum Mechanics.
Springer,
pp. 293–328,
doi:10.1007/978-94-010-1795-4_17.
Brendan D McKay (1998):
Isomorph-free exhaustive generation.
Journal of Algorithms 26(2),
pp. 306–324,
doi:10.1006/jagm.1997.0898.
Joël Ouaknine.
personal communication.
Attended such a lecture of Conway at the Oxford Mathematical Institute in 2005.
Asher Peres (1991):
Two simple proofs of the Kochen-Specker theorem.
Journal of Physics A: Mathematical and General 24(4),
pp. L175,
doi:10.1088/0305-4470/24/4/003.
Asher Peres (1995):
Quantum theory: concepts and methods 57.
Springer.
N. J. A. Sloane:
The On-Line Encyclopedia of Integer Sequences.
Available at http://oeis.org/A000088.
Number of graphs on n unlabeled nodes..
N. J. A. Sloane:
The On-Line Encyclopedia of Integer Sequences.
Available at http://oeis.org/A006786.
Squarefree graphs on n vertices..
Alfred Tarski (1998):
A decision method for elementary algebra and geometry.
Springer.
eptcs@eptcs.org