Probabilization of logics: completeness and decidability
From MaRDI portal
Publication:2254552
DOI10.1007/s11787-013-0087-8zbMath1323.03033MaRDI QIDQ2254552
Publication date: 5 February 2015
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-013-0087-8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Importing logics
- Institution morphisms
- A probabilistic PDL
- Probabilistic logic
- Probabilistic logic programming
- Absolute probability functions for intuitionistic propositional logic
- Admissibility of logical inference rules
- Adding a temporal dimension to a logic system
- Reasoning about infinite computations
- A logic for reasoning about time and reliability
- Synchronization of logics
- A logic for reasoning about probabilities
- Analysis and synthesis of logics. How to cut and paste reasoning systems
- Weakly complete axiomatization of exogenous quantum propositional logic
- Probabilistic temporal logics via the modal mu-calculus
- Verification of Probabilistic Programs
- QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS
- Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification
- Temporalization of Probabilistic Propositional Logic
- A Complete Deductive System for Probability Logic
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Axioms for abstract model theory
- Fibring of logics as a categorial construction
- Decidability and complexity for -regular properties of stochastic systems
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
- Quantum Institutions
