Bar-Hillel and Carnap s Account of Semantic Information

Similar documents
THE LOGIC OF COMPOUND STATEMENTS

Truth-Functional Logic

Section 1.1: Logical Form and Logical Equivalence

PL: Truth Trees. Handout Truth Trees: The Setup

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

First-Degree Entailment

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

1.3 Propositional Equivalences

A statement is a sentence that is definitely either true or false but not both.

240 Metaphysics. Frege s Puzzle. Chapter 26

Verisimilitude and strongly semantic information

CSC Discrete Math I, Spring Propositional Logic

Chapter 4: Classical Propositional Semantics

PHIL12A Section answers, 16 February 2011

15414/614 Optional Lecture 1: Propositional Logic

Hempel s Logic of Confirmation

A Little Deductive Logic

Introduction: What Is Modal Logic?

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Part II On the Equivalence of Scientific Theories

A Little Deductive Logic

1.1 Statements and Compound Statements

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

Propositional Logic: Review

Russell s logicism. Jeff Speaks. September 26, 2007

Data Mining and Machine Learning

Topic 1: Propositional logic

Propositional Logic Review

Proofs. Joe Patten August 10, 2018

1 Completeness Theorem for First Order Logic

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Truth Tables for Propositions

5. And. 5.1 The conjunction

Introduction: What Is Modal Logic?

Logic: Propositional Logic (Part I)

EECS 1028 M: Discrete Mathematics for Engineers

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Kaplan s Paradox and Epistemically Possible Worlds

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Mathematical Logic Part One

Natural Deduction for Propositional Logic

5. And. 5.1 The conjunction

8. Reductio ad absurdum

PHIL 50 - Introduction to Logic

a. ~p : if p is T, then ~p is F, and vice versa

In Defense of Jeffrey Conditionalization

Propositional logic (revision) & semantic entailment. p. 1/34

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Foundation of proofs. Jim Hefferon.

6. Conditional derivations

Introduction to Metalogic

Propositional Logic: Part II - Syntax & Proofs 0-0

Philosophy 244: Modal Logic Preliminaries

8. Reductio ad absurdum

CSE 20: Discrete Mathematics


PROPOSITIONAL CALCULUS

6. Conditional derivations

Deontic Logic and Meta-Ethics

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

Confirmation Theory. Pittsburgh Summer Program 1. Center for the Philosophy of Science, University of Pittsburgh July 7, 2017

Lewis 2 Definitions of T-terms

First Order Logic: Syntax and Semantics

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)

Introduction to Logic and Axiomatic Set Theory

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

CSE 20: Discrete Mathematics

1.1 Language and Logic

HANDOUT AND SET THEORY. Ariyadi Wijaya

Conditional Logic and Belief Revision

INF3170 Logikk Spring Homework #8 For Friday, March 18

Tecniche di Verifica. Introduction to Propositional Logic

Tautologies, Contradictions, and Contingencies

A NEW FOUR-VALUED APPROACH TO MODAL LOGIC JEAN-YVES BEZIAU. In this paper we present several systems of modal logic based on four-valued

MA103 STATEMENTS, PROOF, LOGIC

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Truth Table Definitions of Logical Connectives

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

KB Agents and Propositional Logic

Topics in Logic and Proofs

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

A Structuralist Account of Logic

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Advanced Topics in LP and FP

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Logic for Computer Science - Week 4 Natural Deduction

Intermediate Logic. Natural Deduction for TFL

Math Real Analysis

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Introduction to Intelligent Systems

Lecture 33 Carnap on Theory and Observation

Logic and Mathematics:

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Material Implication and Entailment

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

Natural Deduction in Sentential Logic

Transcription:

Bar-Hillel Carnap s Account of Semantic Information February 19, 2010 Bar-Hillel Carnap s account of semantic information falls under the probabilistic approach to information. [1] Their idea was to measure the quantity of semantic information associated with a statement within a given language in terms of the set of possible worlds it rules out an a priori logical probability space over those worlds. The general idea is based on the Inverse Relationship Principle, according to which the amount of information associated with a proposition is inversely proportional to the probability associated with that proposition. Using some probability measure pr, two measures of information are provided, cont inf, such that: cont(a) = df 1 pr(a) inf(a) = df log 2 (pr(a)) pr here refers to logical probability, as developed by Carnap. [2] It is a measure on the space of possible worlds, which can be represented in a given language using what are called state descriptions. Here is a basic example to illustrate these concepts. The scenario, represented using the familiar propositional logic, concerns the weather conditions for a day in the coming week. The three properties being considered are whether the day will be hot (h), rainy (r) windy (w). Since there are three variable propositions involved, there are eight logically possible ways things can be, there are eight possible worlds. Here is a truth table depicting this: h r w 1 T T T 2 T T F 3 T F T 4 T F F 5 F T T 6 F T F 7 F F T 8 F F F Now, a state description is a conjunction of atomic statements, consisting of each atomic statement or its negation, but never both. Each of these eight possible worlds can be represented with a 1

state description. For example, the state description for state 1 is h r w the state description for 8 is h r w. For the sake of example, the probability distribution I use here will be a simple uniform one. That is, since there are eight possible worlds, each world has a probability of 1 8 that it will obtain or be actual.1 Now we can perform some calculations. Each world or state description has a probability of 1 8, so the probability of it being hot, rainy windy (h r w) is 1 8. Given this cont(h r w) = 1 1 8 = 0.875 inf(h r w) = log 2 ( 1 8 ) = 3 State descriptions are highly informative; a statement which narrows things down to just one of the possible worlds contains the most information. By contrast, if a statement tells us that it will be hot rainy but tells us nothing about whether or not it will be windy (h r), it would be less informative, as the calculations agree. (h r) is true in two of the possible states, so: cont(h r) = 1 2 8 = 0.75 inf(h r) = log 2 ( 2 8 ) = 2 Further still, a statement which only says that it will be hot or windy (h w) is contains relatively little information. (h r) is true in all but two of the possible states, so: cont(h w) = 1 6 8 = 0.25 inf(h w) = log 2 ( 6 8 ) = 0.415 Finally, a tautological statement, which gives us no reduction of the original 8 possibilities, contains no information: cont(h h) = 1 1 = 0 1 Carnap discusses various types of more sophisticated logical probability measures. See http://plato.stanford.edu/entries/probability-interpret/#logpro for an example. 2

inf(h h) = log 2 (1) = 0 It is also worth noting that according to these measures, contradictions contain the most information: cont(h h) = 1 0 = 1 inf(h h) = log 2 (0) = The counter intuitiveness of associating maximal informativeness with necessarily false contradictions will be discussed shortly. Further to these core measurement formulas, Bar-Hillel Carnap added formulas to measure conditional informativeness, that is the informativeness of a statement already given another statement. Given the following definitions: cont(a B) = df cont(a B) cont(b) inf(a B) = df inf(a B) inf(b) it so happens that cont(a B) = cont(b A) inf(a B) = log 2 (pr(a B)). Does the Bar-Hillel/Carnap account provide an acceptable measure of semantic information? To a certain extent its results accord with our intuitions are expected. For example, the statement A B is simply more informative than the statement A B. From this perspective, the more states or possible worlds a statement rules out, the more informative it is. Inevitably though, this approach suffers from some problematic results. The most prominent concerns its wayward calculative assignment of maximal informativeness to contradictions, a result which indicates the discord in basing a quantitative measure of our intuitive notions of information informativeness on logical content. Bar-Hillel Carnap provide the following commentary on the matter: It might perhaps, at first, seem strange that a self-contradictory sentence, hence one which no ideal receiver would accept, is regarded as carrying with it the most inclusive information. It should, however, be emphasised that semantic information is here not meant as implying truth. A false sentence which happens to say much is thereby highly informative in our sense. Whether the information it carries is true or false, scientifically valuable or not, so forth, does not concern us. A self-contradictory sentence asserts too much; it is too informative to be true. [1, pg. 229] 3

So the more a sentence says the more informative it is. But when does a sentence say much? We intuitively judge the statement A B to say more than the statement A B not just because it is less probable or excludes more possible worlds, but also because it does a better, more detailed job of describing how presumably things are. A A on the other h does not at all do a good job of describing how things presumably are. It does not discriminate selectively narrow down on the actual state of affairs (unless a contradiction does actually occur). These considerations suggest that perhaps semantic information is not just about content should be meant as implying truth. Also, another issue related to contradictions concerns conditional information formulas. For example, it is the case that cont(a ) = 0: Proof. cont(a ) = cont( A) = cont( A) = cont( ) = 0 Either some contradiction tolerance (this is another example of an application for paraconsistent logic) or an alternative method of conditional information calculation would be welcome here. Hypothetically speaking, if, given the information of a somehow true contradiction, then all hell breaks loose statements will arguably no longer be informative. But given false contradictory information (the natural alethic value of all contradictory information), surely other statements in general should not lose their conditional informativeness. A paradigmatic example is a database. If the database does contain contradictory data, this should not mean that other data cease to be informative, for they can still very well be informative in the sense of saying something veridical or being useful, independently of the false contradictory data. 4

References [1] Yehoshua Bar-Hillel Rudolf Carnap, Semantic Information. The British Journal for the Philosophy of Science, Vol. 4. No. 14, 1953, 147157. [2] Carnap, R., 1950, Logical Foundations of Probability, Chicago: University of Chicago Press. 5