Login / Signup

Gleason's theorem is not constructively provable.

Geoffrey Hellman
Published in: J. Philos. Log. (1993)
Keyphrases
  • prostate cancer
  • data sets
  • von neumann
  • data mining
  • color images
  • upper bound
  • real time