INFERENCE RULES FOR PROBABILITY LOGIC

Marija Boričić

Abstract: Gentzen’s and Prawitz’s approach to deductive systems, and Carnap’s and Popper’s treatment of probability in logic were two fruitful ideas of logic in the mid-twentieth century. By combining these two concepts, the notion of sentence probability, and the deduction relation formalized by means of inference rules, we introduce a system of inference rules based on the traditional proof-theoretic principles enabling to work with each form of probabilized propositional formulae. Namely, for each propositional connective, we define at least one introduction and one elimination rule, over the formulae of the form $A[a,b]$ with the intended meaning that ’the probability $c$ of truthfulness of a sentence $A$ belongs to the interval $[a,b]\subseteq [0,1]$’. It is shown that our system is sound and complete with respect to the Carnap–Poper-type probability models.

Keywords: consistency; inference rules; probability; soundness; completeness

Classification (MSC2000): 03B48; 03B50; 03B05

Full text of the article: (for faster download, first choose a mirror)

• Compressed DVI file (24 kilobytes)
• Compressed PostScript file (360 kilobytes)
• PDF file (132 kilobytes)