Completeness Theorem for Boolean Models with Strictly Positive Measure
Mathematica Moravica, Tome 4 (2000) no. 1.

Voir la notice de l'article dans eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Rašković [3] introduce a conservative extension of classical propositional logic with some probability operators and prove corresponding completeness and decidability theorem. The aim of this paper is to prove Robinson consistency and Craig interpolation for this logic.
Mots-clés : Probability logic, Strictly positive measure, Boolean models 
@article{MM3_2000_4_1_a6,
     author = {Neboj\v{s}a Ikodinovi\'c},
     title = {Completeness {Theorem} for {Boolean} {Models} with {Strictly} {Positive} {Measure}},
     journal = {Mathematica Moravica},
     pages = {45 - 50},
     publisher = {mathdoc},
     volume = {4},
     number = {1},
     year = {2000},
     url = {https://geodesic-test.mathdoc.fr/item/MM3_2000_4_1_a6/}
}
TY  - JOUR
AU  - Nebojša Ikodinović
TI  - Completeness Theorem for Boolean Models with Strictly Positive Measure
JO  - Mathematica Moravica
PY  - 2000
SP  - 45 
EP  -  50
VL  - 4
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/MM3_2000_4_1_a6/
ID  - MM3_2000_4_1_a6
ER  - 
%0 Journal Article
%A Nebojša Ikodinović
%T Completeness Theorem for Boolean Models with Strictly Positive Measure
%J Mathematica Moravica
%D 2000
%P 45 - 50
%V 4
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/MM3_2000_4_1_a6/
%F MM3_2000_4_1_a6
Nebojša Ikodinović. Completeness Theorem for Boolean Models with Strictly Positive Measure. Mathematica Moravica, Tome 4 (2000) no. 1. https://geodesic-test.mathdoc.fr/item/MM3_2000_4_1_a6/