A quantitative approach to semantic informativity
Anderson de Araújo · arXiv (Cornell University) · 2014
This article shows a form of measuring semantic informativity of deductions. Dynamic concepts of complexity and relevancy are presented according to explicit definitions of insertion and deletion on databases. Hence, with respect to finite databases, it solves Bar-Hillel-Carnap paradox and Hintikka' scandal of deduction.