Linked bibliography for the SEP article "Dependence Logic" by Pietro Galliani
This is an automatically generated and experimental page
If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.
This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.
- Abramsky, Samson and Jouko Väänänen, 2009, “From IF to BI: A Tale of Dependence and Separation”, Synthese, 167(2): 207–230. doi:10.1007/s11229-008-9415-6 (Scholar)
- Arrow, Kenneth J., 1950, “A Difficulty in the Concept of
Social Welfare”, The Journal of Political Economy,
pp.328–346. doi:10.1086/256963 (Scholar)
- Aspect, Alain, Philippe Grangier and Gérard Roger, 1981,
“Experimental Tests of Realistic Local Theories via Bell’s
Theorem”, Physical Review Letters, 47(7):
460–463. doi:10.1103/physrevlett.47.460 (Scholar)
- Bell, J.S., 1964, “On the Einstein-Podolsky-Rosen Paradox”, Physics, 1(3): 195–200. (Scholar)
- Ciardelli, Ivano and Floris Roelofsen, 2011, “Inquisitive Logic”, Journal of Philosophical Logic, 40(1): 55–94. doi:10.1007/s10992-010-9142-6 (Scholar)
- van Ditmarsch, Hans, Wiebe van der Hoek, and Barteld Kooi, 2007,Dynamic Epistemic Logic, (Synthese Library 337), Dordrecht: Springer. doi:10.1007/978-1-4020-5839-4 (Scholar)
- Durand, Arnaud and Juha Kontinen, 2012, “Hierarchies in
Dependence Logic”, ACM Transactions on Computational Logic
(TOCL), 13(4): 1–21. doi:10.1145/2362355.2362359 (Scholar)
- Durand, Arnaud, et al., 2018, “Approximation and dependence
via multiteam semantics”, Annals of Mathematics and
Artificial Intelligence, 83(3): 297–320. (Scholar)
- Durand, Arnaud, et al., 2018, “Probabilistic team
semantics”, International Symposium on Foundations of
Information and Knowledge Systems, Cham: Springer. (Scholar)
- Ebbing, Johannes and Peter Lohmann, 2012, “Complexity of
Model Checking for Modal Dependence Logic”, SOFSEM 2012:
International Conference on Current Trends in Theory and Practice of
Computer Science, (Lecture Notes in Computer Science, 7147),
Berlin, Heidelberg: Springer, pp. 226–237.
doi:10.1007/978-3-642-27660-6_19 (Scholar)
- Ebbing, Johannes, Peter Lohmann, and Fan Yang, 2013, “Model
Checking for Modal Intuitionistic Dependence Logic”,
International Tbilisi Symposium on Logic, Language, and
Computation 2011, (Lecture Notes in Computer Science, 7758),
Berlin, Heidelberg: Springer, pp. 231–256.
doi:10.1007/978-3-642-36976-6_15 (Scholar)
- Einstein, A., B. Podolsky and N. Rosen, 1935, “Can Quantum-Mechanical Description of Physical Reality be Considered Complete?” Physical Review, 47(10): 777–780. doi:10.1103/physrev.47.777 (Scholar)
- Engström, Fredrik, 2012, “Generalized Quantifiers in Dependence Logic”, Journal of Logic, Language and Information, 21(3): 299–324. doi:10.1007/s10849-012-9162-4 (Scholar)
- Engström, Fredrik, Juha Kontinen, and Jouko
Väänänen, 2017, “Dependence logic with
generalized quantifiers: Axiomatizations”, Journal of
Computer and System Sciences, 88: 90–102. (Scholar)
- Fagin, Ronald, 1974, “Generalized First-Order Spectra and
Polynomial-Time Recognizable Sets”, Complexity of
Computation (SIAM-AMS Proceedings 7), Richard M. Karp (ed.),
Providence, RI: American Mathematical Society, pp. 27–41. (Scholar)
- Galliani, Pietro, 2012, “Inclusion and Exclusion Dependencies in Team Semantics—On Some Logics of Imperfect Information”, Annals of Pure and Applied Logic, 163(1): 68–84. doi:10.1016/j.apal.2011.08.005 (Scholar)
- –––, 2015, “The Doxastic Interpretation of Team Semantics”, Logic Without Borders: Essays on Set Theory, Model Theory, Philosophical Logic and Philosophy of Mathematics (Ontos Mathematical Logic, 5), Åsa Hirvonen, Juha Kontinen, Roman Kossak, and Andrés Villaveces (eds), Berlin, Boston: De Gruyter, pp. 167–192. doi:10.1515/9781614516873.167 (Scholar)
- –––, 2015, “Upwards closed dependencies in
team semantics”, Information and Computation, 245:
124–135. (Scholar)
- –––, 2019, “Characterizing downwards closed, strongly first-order, relativizable dependencies”, The Journal of Symbolic Logic, 84(3): 1136–1167 (Scholar)
- –––, forthcoming, “Safe dependency atoms and
possibility operators in team semantics.” Information and
Computation. (Scholar)
- Galliani, Pietro and Lauri Hella, 2013, “Inclusion Logic and
Fixed Point Logic”, Computer Science Logic 2013
(Leibniz International Proceedings in Informatics: LIPIcs 23),
Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,
pp. 281–295. doi:10.4230/lipics.csl.2013.281 (Scholar)
- Galliani, Pietro and Jouko Väänänen, 2014,
“On Dependence Logic”, in Johan van Benthem on Logic
and Information Dynamics (Outstanding contributions to logic, 5),
Alexandru Baltag and Sonja Smets (eds), Cham: Springer, pp.
101–119. doi:10.1007/978-3-319-06025-5_4 (Scholar)
- Grädel, Erich and Jouko Väänänen, 2013, “Dependence and Independence”, Studia Logica, 101(2): 399–410. doi:10.1007/s11225-013-9479-2 (Scholar)
- Groenendijk, Jeroen, 2009, “Inquisitive Semantics: Two Possibilities for Disjunction”, in Peter Bosch, David Gabelaia, & Jérôme Lang (eds), Seventh international Tbilisi Symposium on Language, Logic, and Computation (Lecture Notes in Computer Science: Volume 5422), Springer-Verlag, pp. 80–94. doi:10.1007/978-3-642-00665-4_8 (Scholar)
- Hannula, Miika and Juha Kontinen, 2016, “A Finite
Axiomatization of Conditional Independence and Inclusion
Dependencies”. Information and Computation, 249:
121–137. doi:10.1016/j.ic.2016.04.001 (Scholar)
- Hannula, Miika, et al., 2018, “Complexity of propositional
logics in team semantic”, ACM Transactions on Computational
Logic, 19(1): 1–14.
(Scholar)
- –––, 2019, “Facets of distribution
identities in probabilistic team semantics”, in F. Calimeri,
N. Leone, and M. Manna (eds.), Logics in Artificial
Intelligence, Cham: Springer. (Scholar)
- –––, 2020, “Descriptive complexity of real
computation and probabilistic independence logic”,
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in
Computer Science, Association for Computing Machinery, New York:
550–563.. (Scholar)
- Henkin, Leon, 1961, “Some Remarks on Infinitely Long Formulas”, in Infinitistic Methods (Proceedings of the Symposium on the Foundations of Mathematics, Warsaw, 1959), Oxford: Pergamon Press, pp. 167–183. (Scholar)
- Hodges, Wilfrid, 1997, “Compositional Semantics for a Language of Imperfect Information”, Logic Journal of the IGPL, 5(4): 539–563. doi:10.1093/jigpal/5.4.539 (Scholar)
- Hyttinen, Tapani, Gianluca Paolini and Jouko Väänänen, 2015, “Quantum Team Logic and Bell’s Inequalities”, The Review of Symbolic Logic, 8(4): 722–742. doi:10.1017/s1755020315000192 (Scholar)
- Kontinen, Juha and Ville Nurmi, 2009, “Team Logic and
Second-Order Logic”, in Proceedings of the 16th
International Workshop on Logic, Language, Information, and
Computation (Lecture Notes in Computer Science, 5514),
Berlin, Heidelberg: Springer, pp. 230–241.
doi:10.1007/978-3-642-02261-6_19 (Scholar)
- Kontinen, Juha and Jouko Väänänen, 2009, “On Definability in Dependence Logic”, Journal of Logic, Language and Information, 18(3): 317–332.doi:10.1007/s10849-009-9082-0 (Scholar)
- –––, 2011, “A Remark on Negation in Dependence Logic”, Notre Dame Journal of Formal Logic, 52(1): 55–65. doi:10.1215/00294527-2010-036 (Scholar)
- –––, 2013, “Axiomatizing First-Order Consequences in Dependence Logic”, Annals of Pure and Applied Logic, 164(11): 1101–1117. doi:10.1016/j.apal.2013.05.006 (Scholar)
- Kontinen, Juha, et al., 2017, “Modal independence logic”, Journal of Logic and Computation, 27(5): 1333–1352. (Scholar)
- Kontinen, Juha and Fan Yang, 2019, “Logics for first-order
team properties”, International Workshop on Logic, Language,
Information, and Computation, Berlin, Heidelberg: Springer. (Scholar)
- Kripke, Saul A., 1965, “Semantical Analysis of
Intuitionistic Logic I”, in Formal Systems and Recursive
Functions: Proceedings of the Eighth Logic Colloquium, Oxford July
1963 (Studies in Logic and the Foundations of Mathematics, 40),
John N. Crossley and Michael A. E. Dummett (eds.), North Holland, pp.
92–130. doi:10.1016/S0049–237X(08)71685-9 (Scholar)
- Kuusisto, Antti, 2015, “A double team semantics for
generalized quantifiers”, Journal of Logic, Language and
Information, 24(2): 149–191.
- Lohmann, Peter and Heribert Vollmer, 2013, “Complexity Results for Modal Dependence Logic”, Studia Logica, 101(2): 343–366. doi:10.1007/s11225-013-9483-6 (Scholar)
- Lück, Martin, 2018, “Axiomatizations of team logics”, Annals of Pure and Applied Logic, 169(9): 928–969. (Scholar)
- –––, 2020, “On the complexity of linear
temporal logic with team semantics”, Theoretical Computer
Science, 837: 1–25. (Scholar)
- Pacuit, Eric and Fan Yang, 2016, “Dependence and
Independence in Social Choice: Arrow’S Theorem”, in
Dependence Logic, Samson Abramsky, Juha Kontinen, Jouko
Väänänen, and Heribert Vollmer (eds), Dordrecht:
Springer, pp. 235–260. doi:10.1007/978-3-319-31803-5_11 (Scholar)
- Väänänen, Jouko, 2007a, Dependence Logic: A New Approach to Independence Friendly Logic, (London Mathematical Society student texts, 70), Cambridge: Cambridge University Press. doi:10.1017/cbo9780511611193 (Scholar)
- –––, 2007b, “Team Logic”, in
Interactive Logic: Selected Papers from the 7th Augustus de Morgan
Workshop, (Texts in Logic and Games, 1), Johan van Benthem, Dov
Gabbay, and Benedikt Löwe (eds.), Amsterdam: Amsterdam University
Press, pp. 281–302. (Scholar)
- –––, 2008, “Modal Dependence Logic”,
New Perspectives on Games and Interaction (Texts in Logic and
Games, 4), Krzysztof R. Apt and Robert van Rooij (eds), Amsterdam:
Amsterdam University Press, pp.237–254. (Scholar)
- Virtema, Jonni, 2017, “Complexity of validity for
propositional dependence logics”, Information and
Computation, 253: 224–236. (Scholar)
- Yang, Fan, 2013, “Expressing Second-Order Sentences in Intuitionistic Dependence Logic”, Studia Logica, 101(2): 323–342. doi:10.1007/s11225-013-9476-5 (Scholar)
- –––, 2014, “On Extensions and Variants of
Dependence Logic: A Study of Intuitionistic Connectives in the Team
Semantics Setting”. PhD Thesis, University of Helsinki. (Scholar)
- Yang, Fan and Jouko Väänänen, 2016, “Propositional Logics of Dependence”, Annals of Pure and Applied Logic, 167(7): 557–589. doi:10.1016/j.apal.2016.03.003 (Scholar)