@techreport{Flax:1993,
  abstract = {A metric can be defined between pairs of formulae of first order logic. The definition is based upon a given set of interpretations. The method is analogous to the definition of the Hamming distance between binary words, except that the role of bit position is played by a whole interpretation. (The Hamming distance between two binary words counts the number of bit positions at which the two words differ.) Using this metric, the connectives ``and'', ``or'' and ``not'' turn out to be uniformly continous functions. The above metric is also used to measure the truth of certain implications arising from statistical contingency tables.},
  added-at = {2007-12-14T02:38:50.000+0100},
  author = {Flax, Lee},
  biburl = {http://www.bibsonomy.org/bibtex/27ae38d908ea5e7f73c6c4192069a1896/diego_ma},
  institution = {Macquarie University},
  interhash = {5dfbc28e9c502f782d2811405b8c2838},
  intrahash = {7ae38d908ea5e7f73c6c4192069a1896},
  keywords = {logic},
  number = {93-139C},
  timestamp = {2007-12-14T02:38:50.000+0100},
  title = {Application of the Hamming Distance Between Logical Formulae to Statistical Contingency Tables},
  year = 1993
}