Duligur Ibeling, Thomas Icard, Krzysztof Mierzewski, Milan Mossé
{"title":"探究概率推理中的定量与定性之分","authors":"Duligur Ibeling, Thomas Icard, Krzysztof Mierzewski, Milan Mossé","doi":"10.1016/j.apal.2023.103339","DOIUrl":null,"url":null,"abstract":"<div><p>This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely ‘qualitative’ comparative language to a highly ‘quantitative’ language involving arbitrary polynomials over probability terms. While talk of qualitative vs. quantitative may be suggestive, we identify a robust and meaningful boundary in the space by distinguishing systems that encode (at most) additive reasoning from those that encode additive and multiplicative reasoning. The latter includes not only languages with explicit multiplication but also languages expressing notions of dependence and conditionality. We show that the distinction tracks a divide in computational complexity: additive systems remain complete for <span><math><mi>NP</mi></math></span>, while multiplicative systems are robustly complete for <span><math><mo>∃</mo><mi>R</mi></math></span>. We also address axiomatic questions, offering several new completeness results as well as a proof of non-finite-axiomatizability for comparative probability. Repercussions of our results for conceptual and empirical questions are addressed, and open problems are discussed.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007223000969/pdfft?md5=fe6c1d17dffc09f1f8840ad511ee381a&pid=1-s2.0-S0168007223000969-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Probing the quantitative–qualitative divide in probabilistic reasoning\",\"authors\":\"Duligur Ibeling, Thomas Icard, Krzysztof Mierzewski, Milan Mossé\",\"doi\":\"10.1016/j.apal.2023.103339\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely ‘qualitative’ comparative language to a highly ‘quantitative’ language involving arbitrary polynomials over probability terms. While talk of qualitative vs. quantitative may be suggestive, we identify a robust and meaningful boundary in the space by distinguishing systems that encode (at most) additive reasoning from those that encode additive and multiplicative reasoning. The latter includes not only languages with explicit multiplication but also languages expressing notions of dependence and conditionality. We show that the distinction tracks a divide in computational complexity: additive systems remain complete for <span><math><mi>NP</mi></math></span>, while multiplicative systems are robustly complete for <span><math><mo>∃</mo><mi>R</mi></math></span>. We also address axiomatic questions, offering several new completeness results as well as a proof of non-finite-axiomatizability for comparative probability. Repercussions of our results for conceptual and empirical questions are addressed, and open problems are discussed.</p></div>\",\"PeriodicalId\":50762,\"journal\":{\"name\":\"Annals of Pure and Applied Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0168007223000969/pdfft?md5=fe6c1d17dffc09f1f8840ad511ee381a&pid=1-s2.0-S0168007223000969-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Pure and Applied Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0168007223000969\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007223000969","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
Probing the quantitative–qualitative divide in probabilistic reasoning
This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely ‘qualitative’ comparative language to a highly ‘quantitative’ language involving arbitrary polynomials over probability terms. While talk of qualitative vs. quantitative may be suggestive, we identify a robust and meaningful boundary in the space by distinguishing systems that encode (at most) additive reasoning from those that encode additive and multiplicative reasoning. The latter includes not only languages with explicit multiplication but also languages expressing notions of dependence and conditionality. We show that the distinction tracks a divide in computational complexity: additive systems remain complete for , while multiplicative systems are robustly complete for . We also address axiomatic questions, offering several new completeness results as well as a proof of non-finite-axiomatizability for comparative probability. Repercussions of our results for conceptual and empirical questions are addressed, and open problems are discussed.
期刊介绍:
The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.