Logics for reasoning about degrees of confirmation
Files
Publication date
2021-12
Authors
Dautovic, Sejla
Doder, Dragan
Ognjanovic, Zoran
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
taverne
Abstract
In this paper, we present a first-order and a propositional logic for reasoning about degrees of confirmation. We define the appropriate formal languages and describe the corresponding classes of models. We provide infinitary axiomatizations for both logics and we prove that the axiomatizations are sound and strongly complete. We also show that our propositional logic is decidable. For some restrictions of the logics, we provide finitary axiomatic systems.
Keywords
probabilistic logic, measure of confirmation, completeness theorem, decidability, Taverne
Citation
Dautovic, S, Doder, D & Ognjanovic, Z 2021, 'Logics for reasoning about degrees of confirmation', Journal of Logic and Computation, vol. 31, no. 8, pp. 2189-2217. https://doi.org/10.1093/logcom/exab033