Completeness theorem for propositional probabilistic models whose measures have only finite ranges
From MaRDI portal
Recommendations
Cited in
(23)- Sequent calculus for classical logic probabilized
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- A probabilistic logic between \(LPP_1\) and \(LPP_2\)
- On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events
- Completeness theorems for \(\sigma \)-additive probabilistic semantics
- Completeness theorem for probability models with finitely many valued measure
- A logic with approximate conditional probabilities that can model default reasoning
- Completeness theorem for biprobability models
- scientific article; zbMATH DE number 1823891 (Why is no real title available?)
- scientific article; zbMATH DE number 3857062 (Why is no real title available?)
- \(p\)-adic probability logics
- scientific article; zbMATH DE number 1123883 (Why is no real title available?)
- scientific article; zbMATH DE number 1123884 (Why is no real title available?)
- Editorial: Weighted logics for artificial intelligence -- an introductory discussion
- Hierarchies of probabilistic logics
- scientific article; zbMATH DE number 1929309 (Why is no real title available?)
- Completeness theorem for probability models with finitely many valued measure in logic with integrals
- Adelic uncertainty logic
- Soundness and completeness of the axioms of a probabilistic modal logic
- Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm
- Completeness theorem for a logic with imprecise and conditional probabilities
- A logic with probabilistic Jaccard similarity
- Completeness theorem for topological class models
This page was built for publication: Completeness theorem for propositional probabilistic models whose measures have only finite ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701749)
