I provide a method of measuring the inconsistency of a set of sentences from 1-consistency, corresponding to complete consistency, to 0-consistency, corresponding to the explicit presence of a contradiction. Using this notion to analyze the lottery paradox, one can see that the set of sentences capturing the paradox has a high degree of consistency (assuming, of course, a sufficiently large lottery). The measure of consistency, however, is not limited to paradoxes. I also provide results for general sets of sentences.

In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...) intended meaning—the probability of propositional formula α is in the equation image-ball with the center r and the radius ρ. Due to modal nature of the operators Kr, ρ, it was natural to use the probability Kripke like models as equation image-structures, provided that probability functions range over equation image instead of equation image or equation image. (shrink)

In this article we present a p-adic valued probabilistic logic equation image which is a complete and decidable extension of classical propositional logic. The key feature of equation image lies in ability to formally express boundaries of probability values of classical formulas in the field equation image of p-adic numbers via classical connectives and modal-like operators of the form Kr, ρ. Namely, equation image is designed in such a way that the elementary probability sentences Kr, ρα actually do have their (...) intended meaning—the probability of propositional formula α is in the equation image-ball with the center r and the radius ρ. Due to modal nature of the operators Kr, ρ, it was natural to use the probability Kripke like models as equation image-structures, provided that probability functions range over equation image instead of equation image or equation image. (shrink)

A conjectural inference is proposed, aimed at producing conjectural theorems from formal conjectures assumed as axioms, as well as admitting contradictory statements as conjectural theorems. To this end, we employ Paraconsistent Informational Logic, which provides a formal setting where the notion of conjecture formulated by an epistemic agent can be defined. The paraconsistent systems on which conjectural deduction is based are sequent formulations of the C-systems presented in Carnielli-Marcos [CAR 02b]. Thus, conjectural deduction may also be considered to be a (...) tool for investigating the properties of paraconsistency in general. (shrink)