Completeness theorems for σ–additive probabilistic semantics

Annals of Pure and Applied Logic 171 (4):102755 (2020)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Symmetric and dual paraconsistent logics.Norihiro Kamide & Heinrich Wansing - 2010 - Logic and Logical Philosophy 19 (1-2):7-30.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Completeness of S4 for the Lebesgue Measure Algebra.Tamar Lando - 2012 - Journal of Philosophical Logic 41 (2):287-316.

Analytics

Added to PP
2019-11-07

Downloads
41 (#390,173)

6 months
18 (#143,743)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Probabilistic logic.Nils J. Nilsson - 1986 - Artificial Intelligence 28 (1):71-87.
An analysis of first-order logics of probability.Joseph Y. Halpern - 1990 - Artificial Intelligence 46 (3):311-350.
Probability logic.Theodore Hailperin - 1984 - Notre Dame Journal of Formal Logic 25 (3):198-212.

View all 12 references / Add more references