Bridge: RSA Hurford Constraint → Phenomena

Connects the RSA Hurford constraint model (RSA.Hurford) to empirical data from Phenomena.ScalarImplicatures.Basic.

Bridge content

• rsa_matches_data_someOrAll: RSA predicts "some or all" is felicitous
• rsa_matches_data_americanCalifornian: RSA predicts "American or Californian" is infelicitous

theorem Phenomena.ScalarImplicatures.Studies.RSAHurford.rsa_matches_data_someOrAll : someOrAll.felicitous = true

RSA prediction matches empirical data for "some or all".

The model predicts "some or all" is felicitous (disjunction informative under refined lexicon), matching the empirical judgment in Data.lean.

theorem Phenomena.ScalarImplicatures.Studies.RSAHurford.rsa_matches_data_americanCalifornian : americanCalifornian.felicitous = false

RSA prediction matches empirical data for "American or Californian".

RSA predicts infelicity (disjunction always redundant), matching the empirical judgment.