A quantitative approach to semantic informativity

Published 15 Apr 2014 in math.LO and cs.LO | (1404.3782v3)

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.

Abstract PDF Upgrade to Chat

Citations (1)

View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Anderson de Araújo

Collections

Sign up for free to add this paper to one or more collections.