Completeness theorem for a logic with imprecise and conditional probabilities
From MaRDI portal
Recommendations
Cited in
(15)- Sequent calculus for classical logic probabilized
- Completeness and incompleteness for plausibility logic
- A propositional probabilistic logic with discrete linear time for reasoning about evidence
- A p-adic probability logic
- \(p\)-adic probability logics
- How to Restore Compactness into Probabilistic Logics?
- Interpolative Boolean Logic
- Qualitative Possibilities and Necessities
- Hierarchies of probabilistic logics
- Conditional \(p\)-adic probability logic
- Barwise Completeness Theorems for Some Biprobability Logics
- Adelic uncertainty logic
- Logics with Probability Operators
- Some New Probability Operators
- Finitely additive probability measures on classical propositional formulas definable by Gödel's t-norm and product t-norm
This page was built for publication: Completeness theorem for a logic with imprecise and conditional probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450397)