On probability and logic

DOI10.4171/PM/2007MaRDI QIDQ2413201zbMATH OpenOpenAlexFDO

Authors Amílcar Sernadas, João Rasga, Cristina Sernadas

Publication date 9 April 2018

Published in Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.02915

zbMATH Keywords

decidabilityprobabilistic entailmentprobabilistic propositional logicstochastic valuation

Mathematics Subject Classification ID

Probability and inductive logic (03B48) Foundations of stochastic processes (60G05)

Abstract: Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is proposed and shown to collapse into the classical entailment when the language is left unchanged. Motivated by this result, a decidable conservative enrichment of propositional logic is proposed by giving the appropriate semantics to a new language construct that allows the constraining of the probability of a formula. A sound and weakly complete axiomatization is provided using the decidability of the theory of real closed ordered fields.

Review text

Summary: Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations by means of stochastic valuations. A stochastic valuation is a stochastic process, that is a family of random variables one for each propositional symbol. With stochastic valuations we are able to cope with a countably infinite set of propositional symbols. A notion of probabilistic entailment enjoying desirable properties of logical consequence is defined and shown to collapse into the classical entailment when the propositional language is left unchanged. Motivated by this result, a decidable conservative enrichment of propositional logic is proposed by giving the appropriate semantics to a new language construct that allows the constraining of the probability of a formula. A sound and weakly complete axiomatization is provided using the decidability of the theory of real closed ordered fields.

Recommendations

• scientific article; zbMATH DE number 988760
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Probability logic
• A probabilistic extension of intuitionistic logic
• A logic for reasoning about probabilities

Cited in

(12)

• Probability semantics for quantifier logic
• Event-based time-stamped claim logic
• From propositional logic to plausible reasoning: a uniqueness theorem
• Probability and symmetric logic
• Complex valued probability logics
• scientific article; zbMATH DE number 988760 (Why is no real title available?)
• Exogeneous semantics approach to enriching logics
• scientific article; zbMATH DE number 741002 (Why is no real title available?)
• scientific article; zbMATH DE number 1014107 (Why is no real title available?)
• Probability propositional calculus with doubled nonstandard semantics.
• Logical perspectives on the foundations of probability
• Probabilistic semantics and calculi for multi-valued and paraconsistent logics

This page was built for publication: On probability and logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413201)