{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:03:14Z","timestamp":1753437794728},"reference-count":48,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T00:00:00Z","timestamp":1522627200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2018,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline1\" \/><jats:tex-math>${\\cal D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and Propositional Independence Logic<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline2\" \/><jats:tex-math>${\\cal I}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline3\" \/><jats:tex-math>${{\\cal L}_D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline4\" \/><jats:tex-math>${{\\cal L}_{\\,I\\,}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, based on Kripke semantics, and propose them as alternatives for<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline5\" \/><jats:tex-math>${\\cal D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline6\" \/><jats:tex-math>${\\cal I}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to natural language. We argue that<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline7\" \/><jats:tex-math>${{\\cal L}_D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline8\" \/><jats:tex-math>${{\\cal L}_{\\,I\\,}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>naturally resolve a range of interpretational problems that arise in<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline9\" \/><jats:tex-math>${\\cal D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline10\" \/><jats:tex-math>${\\cal I}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. We also obtain sound and complete axiomatizations for<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline11\" \/><jats:tex-math>${{\\cal L}_D}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>and<jats:inline-formula><jats:alternatives><jats:graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" orientation=\"portrait\" mime-subtype=\"gif\" mimetype=\"image\" position=\"float\" xlink:type=\"simple\" xlink:href=\"S1755020317000272_inline12\" \/><jats:tex-math>${{\\cal L}_{\\,I\\,}}$<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1017\/s1755020317000272","type":"journal-article","created":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T10:18:04Z","timestamp":1522664284000},"page":"470-506","source":"Crossref","is-referenced-by-count":8,"title":["LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE"],"prefix":"10.1017","volume":"11","author":[{"given":"VALENTIN","family":"GORANKO","sequence":"first","affiliation":[]},{"given":"ANTTI","family":"KUUSISTO","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2018,4,2]]},"reference":[{"key":"S1755020317000272_ref43","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctv2x8v91j","volume-title":"Foundations of Gestalt Theory","author":"Smith","year":"1988"},{"key":"S1755020317000272_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2011.08.005"},{"key":"S1755020317000272_ref31","doi-asserted-by":"publisher","DOI":"10.1111\/phc3.12072"},{"key":"S1755020317000272_ref33","first-page":"277","volume-title":"CSL","volume":"2015","author":"Kontinen","year":"2015"},{"key":"S1755020317000272_ref9","unstructured":"Fan J . (2016). A modal logic of supervenience. Preprint, arXiv:1611.04740v1."},{"key":"S1755020317000272_ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-013-0282-4"},{"key":"S1755020317000272_ref3","author":"Ciardelli","year":"2009"},{"key":"S1755020317000272_ref47","unstructured":"Yang F . (2016). Uniform definability in propositional dependence logic. Preprint, arXiv:1501.00155."},{"key":"S1755020317000272_ref1","volume-title":"The Stanford Encyclopedia of Philosophy","author":"Aloni","year":"2016"},{"key":"S1755020317000272_ref15","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.1.5"},{"key":"S1755020317000272_ref39","first-page":"318","article-title":"Contingency and noncontingency bases for normal modal logics","volume":"9","author":"Montgomery","year":"1966","journal-title":"Logique et Analyse"},{"key":"S1755020317000272_ref18","first-page":"269","volume-title":"MFCS 2015, Proceedings, Part I","author":"Hannula","year":"2015"},{"key":"S1755020317000272_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31803-5_8"},{"key":"S1755020317000272_ref45","first-page":"237","volume-title":"New Perspectives on Games and Interaction","author":"V\u00e4\u00e4n\u00e4nen","year":"2008"},{"key":"S1755020317000272_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01181684"},{"key":"S1755020317000272_ref26","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1305\/ndjfl\/1040248455","article-title":"The logic of noncontingency","volume":"36","author":"Humberstone","year":"1995","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"S1755020317000272_ref46","author":"Yang","year":"2014"},{"key":"S1755020317000272_ref36","unstructured":"Kuusisto A . (2015). A double team semantics for generalized quantifiers. Preprint, arXiv:1310.3032v9."},{"key":"S1755020317000272_ref23","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/5.4.539"},{"key":"S1755020317000272_ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004944015811"},{"key":"S1755020317000272_ref28","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1071509431"},{"key":"S1755020317000272_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020314000343"},{"key":"S1755020317000272_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11787-012-0071-8"},{"key":"S1755020317000272_ref5","author":"Ciardelli","year":"2016"},{"key":"S1755020317000272_ref29","unstructured":"Humberstone L . (2017). Supervenience, dependence, disjunction. Unpublished Manuscript."},{"key":"S1755020317000272_ref32","first-page":"353","volume-title":"AiML 10","author":"Kontinen","year":"2014"},{"key":"S1755020317000272_ref14","unstructured":"Goranko V. & Kuusisto A . (2016). Logics for propositional determinacy and independence. Preprint, arXiv:1609.07398."},{"key":"S1755020317000272_ref20","first-page":"294","volume-title":"AiML 10","author":"Hella","year":"2014"},{"key":"S1755020317000272_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-013-9478-3"},{"key":"S1755020317000272_ref35","unstructured":"Kuusisto A . (2015). A double team semantics for generalized quantifiers. Preprint, arXiv:1310.3032v8."},{"key":"S1755020317000272_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-013-9483-6"},{"key":"S1755020317000272_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-007-9044-y"},{"key":"S1755020317000272_ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2016.03.003"},{"key":"S1755020317000272_ref30","first-page":"327","volume-title":"Compositionality: The Significant Difference, International Symposium, COMPOS\u201997","author":"Janssen","year":"1997"},{"key":"S1755020317000272_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-013-9479-2"},{"key":"S1755020317000272_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624919"},{"key":"S1755020317000272_ref13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-319-06025-5_4","volume-title":"Johan F. A. K. van Benthem on Logical and Informational Dynamics","author":"Galliani","year":"2014"},{"key":"S1755020317000272_ref19","first-page":"281","volume-title":"MFCS 2015, Proceedings, Part I","author":"Hella","year":"2015"},{"key":"S1755020317000272_ref38","volume-title":"The Stanford Encyclopedia of Philosophy","author":"McLaughlin","year":"2018"},{"key":"S1755020317000272_ref22","first-page":"571","volume-title":"Logic, Methodology and Philosophy of Science","volume":"Vol. 8","author":"Hintikka","year":"1989"},{"key":"S1755020317000272_ref24","first-page":"101","article-title":"Some structural and logical aspects of the notion of supervenience","volume":"35","author":"Humberstone","year":"1992","journal-title":"Logique et Analyse"},{"key":"S1755020317000272_ref2","first-page":"580","volume-title":"IFIP\u201974","author":"Armstrong","year":"1974"},{"key":"S1755020317000272_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10992-010-9142-6"},{"key":"S1755020317000272_ref17","volume-title":"Proceedings of the 5th International Congress for the Unity of Science","author":"Grelling","year":"1939"},{"key":"S1755020317000272_ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611193"},{"key":"S1755020317000272_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-014-0404-7"},{"key":"S1755020317000272_ref27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1305\/ndjfl\/1039293066","article-title":"Note on supervenience and definability","volume":"39","author":"Humberstone","year":"1998","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"S1755020317000272_ref34","unstructured":"Kuusisto A . (2014). A double team semantics for generalized quantifiers. Preprint, arXiv:1310.3032v5."}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020317000272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T21:52:17Z","timestamp":1693605137000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020317000272\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,2]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S1755020317000272"],"URL":"https:\/\/doi.org\/10.1017\/s1755020317000272","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,2]]}}}