A quantitative approach to semantic informativity
Logic
2014-04-25 v3 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1404.3782,
title = {A quantitative approach to semantic informativity},
author = {Anderson de Araújo},
journal= {arXiv preprint arXiv:1404.3782},
year = {2014}
}