On probability and logic (Q2413201): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Amílcar Sernadas / rank | |||
Property / author | |||
Property / author: João Rasga / rank | |||
Property / author | |||
Property / author: Cristina Sernadas / rank | |||
Property / author | |||
Property / author: Amílcar Sernadas / rank | |||
Normal rank | |||
Property / author | |||
Property / author: João Rasga / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Cristina Sernadas / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1601.02915 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963603050 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:23, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On probability and logic |
scientific article |
Statements
On probability and logic (English)
0 references
9 April 2018
0 references
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.
0 references
probabilistic propositional logic
0 references
stochastic valuation
0 references
probabilistic entailment
0 references
decidability
0 references