Probabilization of logics: completeness and decidability
From MaRDI portal
Publication:2254552
Recommendations
Cites work
- A complete deductive system for probability logic
- A logic for reasoning about probabilities
- A logic for reasoning about time and reliability
- A probabilistic PDL
- Absolute probability functions for intuitionistic propositional logic
- Adding a temporal dimension to a logic system
- Admissibility of logical inference rules
- Analysis and synthesis of logics. How to cut and paste reasoning systems
- Axioms for abstract model theory
- Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
- Decidability and complexity for \(\omega \)-regular properties of stochastic systems
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
- Exogeneous semantics approach to enriching logics
- Fibring of logics as a categorial construction
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3864486 (Why is no real title available?)
- scientific article; zbMATH DE number 1157649 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 805093 (Why is no real title available?)
- scientific article; zbMATH DE number 1418362 (Why is no real title available?)
- scientific article; zbMATH DE number 3067647 (Why is no real title available?)
- Importing logics
- Institution morphisms
- Modal logic
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Probabilistic logic
- Probabilistic logic programming
- Probabilistic temporal logics via the modal mu-calculus
- QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
- Quantum Institutions
- Reasoning about infinite computations
- Synchronization of logics
- Temporalization of Probabilistic Propositional Logic
- Verification of Probabilistic Programs
- Weakly complete axiomatization of exogenous quantum propositional logic
Cited in
(16)- An algebraic synthesis of the foundations of logic and probability
- Probabilistic semantics for Delgrande's conditional logic and a counterexample to his default logic
- On consistency in probabilistic logic for logical formulas represented by B-hypertrees
- Soundness and completeness results for LEA and probability semantics
- On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events
- Towards classifying propositional probabilistic logics
- Epistemic logics with structured knowledge
- Combining probability and logic: papers from Progic 2011
- Possibilistic logic: Complexity and algorithms
- scientific article; zbMATH DE number 4172426 (Why is no real title available?)
- Exogeneous semantics approach to enriching logics
- scientific article; zbMATH DE number 465528 (Why is no real title available?)
- Complexity Results for Probabilistic Datalog
- Computability of validity and satisfiability in probability logics over finite and countable models
- Barwise Completeness Theorems for Some Biprobability Logics
- Decidability of finite probabilistic propositional dynamic logics
This page was built for publication: Probabilization of logics: completeness and decidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254552)
