Linked bibliography for the SEP article "Independence Friendly Logic" by Tero Tulenheimo
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.
- Auxier, R. E. and Hahn, L. E. (eds.), 2006, The Philosophy of Jaakko Hintikka, (Library of Living Philosophers, Volume 30), Chicago: Open Court. (Scholar)
- Barbero, F., 2013, “On Existential Declarations of Independence in IF Logic,” Review of Symbolic Logic, 6(2): 254–280. (Scholar)
- –––, 2017, “Cooperation in Games and Epistemic Readings of Independence-Friendly Sentences,” Journal of Logic, Language, and Information, 26(3): 221–260. (Scholar)
- –––, 2021, “Complexity of Syntactical Tree Fragments of Independence-Friendly Logic,” Annals of Pure and Applied Logic, 172(1): article 102859 (43 pages). (Scholar)
- Barbero, F., Hella, L., and Rönnholm, R., 2021, “Independence-Friendly Logic Without Henkin Quantification,” Archive for Mathematical Logic, 60: 547–597. (Scholar)
- Barwise, J., 1979, “On Branching Quantifiers in English,” Journal of Philosophical Logic, 8: 47–80. (Scholar)
- Barwise, J., and Moschovakis, Y. N., 1978, “Global Inductive Definability,” Journal of Symbolic Logic, 43(3): 521–534. (Scholar)
- Bazzoni, A., 2015, “Hintikka on the Foundations of Mathematics: IF Logic and Uniformity Concepts,” Journal of Philosophical Logic, 44(5): 507–516. (Scholar)
- van Benthem, J., and Doets, K., 2001, “Higher-Order Logic,” in Handbook of Philosophical Logic, (2nd edition, Vol. 1), D. M. Gabbay, and F. Guenthner (eds.), Berlin: Springer, pp. 189–244. (Scholar)
- Blass, A., and Gurevich, Y., 1986, “Henkin Quantifiers and Complete Problems,” Annals of Pure and Applied Logic, 32: 1–16. (Scholar)
- Brasoveanu, A., and Farkas, D. F., 2011, “How Indefinites Choose Their Scope,” Linguistics and Philosophy, 34(1): 1–55. (Scholar)
- Burgess, J. P., 2003, “A Remark on Henkin Sentences and Their Contraries,” Notre Dame Journal of Formal Logic, 44: 185–188. (Scholar)
- Caicedo X., Dechesne, F., and Janssen, T. M. V., 2009, “Equivalence and Quantifier Rules for Logic with Imperfect Information,” Logic Journal of the IGPL, 17(1): 91–129. (Scholar)
- Cameron, P., and Hodges, W., 2001, “Some Combinatorics of Imperfect Information,” Journal of Symbolic Logic, 66: 673–684. (Scholar)
- Carlson, L., and Hintikka, J., 1979, “Conditionals, Generic
Quantifiers, and Other Applications of Subgames,” in
Game-Theoretical Semantics, E. Saarinen (ed.), Dordrecht:
Reidel, pp. 179–214. (Scholar)
- Carlson, L., and ter Meulen, A., 1979, “Informational
Independence in Intensional Contexts,” in Essays in Honour
of Jaakko Hintikka, E. Saarinen, I. Niiniluoto, R. Hilpinen, and
M. Provence (eds.), Dordrecht: Reidel, pp. 61–72. (Scholar)
- Clark, R., 2012, Meaningful Games: Exploring Language with
Game Theory, Cambridge, MA: The MIT Press. (Scholar)
- Dechesne, F., 2005, Game, Set, Math: Formal Investigations
into Logic with Imperfect Information, Ph.D. Thesis, Eindhoven:
University of Tilburg. (Scholar)
- Ebbinghaus, H.-D., and Flum, J., 1999, Finite Model
Theory, Berlin: Springer, 2nd edition. (Scholar)
- Ebbinghaus, H.-D., Flum, J., and Thomas, W., 1994,
Mathematical Logic, New York: Springer, 2nd edition. (Scholar)
- Enderton, H. B., 1970, “Finite Partially-Ordered Quantifiers,” Zeitschrift für matematische Logik und Grundlagen der Mathematik, 16: 393–397. (Scholar)
- Engdahl, E., 1986, Constituent Questions: The Syntax and Semantics of Questions with Special Reference to Swedish, Dordrecht: Reidel. (Scholar)
- Fagin, R., 1974, “Generalized First-Order Spectra and
Polynomial-Time Recognizable Sets,” in Complexity of
Computation, (SIAM-AMS Proceedings, Volume 7), R. M. Karp (ed.),
pp. 43–73. (Scholar)
- Feferman, S., 2006, “What Kind of Logic is
‘Independence-Friendly’ Logic?,” in Auxier &
Hahn (2006), pp. 453–469. (Scholar)
- Figueira, S., Gorín, D., and Grimson, R., 2009, “On
the Formal Semantics of IF-like Logics,” Journal of Computer
and System Sciences, 76: 333–346. (Scholar)
- –––, 2011, “On the Expressive Power of
IF-Logic with Classical Negation” in Logic, Language,
Information, and Computation, L. Beklemishev and R. de Queiroz
(eds.), Berlin: Springer, pp. 135–145. (Scholar)
- –––, 2014, “Independence Friendly Logic
with Classical Negation via Flattening is a Second-Order Logic with
Weak Dependencies,” Journal of Computer and System
Sciences, 80: 1102–1118. (Scholar)
- Forster, T., 2006, “Deterministic and Nondeterministic Strategies for Hintikka Games in First-Order and Branching-Quantifier Logic,” Logique et Analyse, 195: 265–269. (Scholar)
- Fortnow, L., 2009, “The Status of the P versus NP
Problem,” Communications of the ACM, 52(9):
78–86. (Scholar)
- Gödel, K., 1930, “Die Vollständigkeit der Axiome
des logisch Funktionenkalküls,” Monatshefte für
Mathematik und Physik, 37: 349–360. (Scholar)
- –––, 1933, “Eine Interpretation des
intuitionistischen Aussagenkalkuls,” Ergebnisse eines
mathematischen Kolloquiums, 4: 39–40. (Scholar)
- –––, 1947, “What is Cantor’s
Continuum Problem?,” The American Mathematical Monthly,
54: 515–525. (Scholar)
- Grädel E., Kolaitis, P. G., Libkin, L., Marx, M., Spencer, J., Vardi, M. Y., Venema, Y., and Weinstein, S., 2007, Finite Model Theory and Its Applications, Berlin: Springer. (Scholar)
- Hella, L., and Sandu, G., 1995, “Partially Ordered Connectives and Finite Graphs,” in Quantifiers: Logics, Models and Computation, Vol. 2, M. Krynicki, M. Mostowski, and L. W. Szczerba (eds.), Dordrecht: Kluwer, pp. 79–88. (Scholar)
- Hella, L., Sevenster, M., and Tulenheimo, T., 2008, “Partially Ordered Connectives and Monadic Monotone Strict NP,” Journal of Logic, Language and Information, 17(3): 323–344. (Scholar)
- Henkin, L., 1950, “Completeness in the Theory of Types,” Journal of Symbolic Logic, 15: 81–91. (Scholar)
- –––, 1961, “Some Remarks on Infinitely Long Formulas,” in Infinitistic Methods (no ed. given), New York: Pergamon Press, pp. 167–183. (Scholar)
- Hilbert, D., 1903, Grundlagen der Geometrie, Leipzig:
Teubner, 2nd edition. (1st edition: “Grundlagen der
Geometrie,” in Festschrift zur Feier der Enthüllung des
Gauss-Weber-Denkmals in Göttingen 3–92, Leipzig:
Teubner, 1899.) (Scholar)
- Hinman, P. G., 1978, Recursion-Theoretic Hierarchies, Berlin: Springer, 1978. (Scholar)
- Hintikka, J., 1955, “Reductions in the Theory of
Types,” Acta Philosophica Fennica, 8, pp. 61–115. (Scholar)
- –––, 1968, “Language-Games for Quantifiers,” in American Philosophical Quarterly Monograph Series 2: Studies in Logical Theory, Oxford: Basil Blackwell, pp. 46–72; reprinted in Hintikka 1973b, Ch. III. (Scholar)
- –––, 1973a, “Quantifiers vs. Quantification Theory,” Dialectica, 27: 329–358; reprinted in 1974 in Linguistic Inquiry, 5: 153–177. (Scholar)
- –––, 1973b, Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic, Oxford: Clarendon Press. (Scholar)
- –––, 1976a, “Quantifiers in Logic and
Quantifiers in Natural Languages,” in Philosophy of
Logic, S. Körner (ed.), Oxford: Basil Blackwell, pp.
208–232. (Scholar)
- –––, 1976b, The Semantics of Questions and the Questions of Semantics, Acta Philosophica Fennica, 28(4). (Scholar)
- –––, 1979, “Quantifiers in Natural
Languages: Some Logical Problems,” in Game-Theoretical
Semantics, E. Saarinen (ed.), Dordrecht: Reidel, pp.
81–117. (Scholar)
- –––, 1982, “On Games, Questions, and
Strange Quantifiers,” in Philosophical Essays Dedicated to
Lennart Åqvist on his Fiftieth Birthday, T. Pauli (ed.),
Department of Philosophy, Uppsala: University of Uppsala, pp.
159–169. (Scholar)
- –––, 1986, “Extremality Assumptions in the Foundations of Mathematics,” Proceedings of the Biennial Meeting of the Philosophy of Science Association 1986, Vol. 2, pp. 247–252. (Scholar)
- –––, 1987, “Is Scope a Viable Concept in
Semantics?,” in ESCOL ‘86. Proceedings of the Third
Eastern States Conference on Linguistics, A. Miller, and Z.-S.
Zhang (eds.), pp. 259–270. (Scholar)
- –––, 1988, “On the Development of the Model-Theoretic Viewpoint in Logical Theory,” Synthese, 77: 1–36. (Scholar)
- –––, 1990, “Paradigms for Language Theory” in Language, Knowledge and Intentionality: Perspectives on the Philosophy of Jaakko Hintikka, L. Haaparanta, M. Kusch, and I. Niiniluoto (eds.): Acta Philosophia Fennica, 49, pp. 181–209; reprinted in Hintikka, J., 1998, Paradigms for Language Theory and Other Essays (Jaakko Hintikka: Selected Papers, Volume 4), Dordrecht: Kluwer, pp. 146–174. (Scholar)
- –––, 1991, Defining Truth, the Whole Truth
and Nothing but the Truth, Reports from the Department of
Philosophy, no. 2, Helsinki: University of Helsinki; a revised version
reprinted in Hintikka, J., 1997, Lingua Universalis vs. Calculus
Ratiocinator: An Ultimate Presupposition of Twentieth-Century
Philosophy (Jaakko Hintikka: Selected Papers, Volume 2),
Dordrecht: Kluwer, pp. 46–103. (Scholar)
- –––, 1993, “New Foundations for
Mathematical Theories,” in Logic Colloquium ‘90,
Lecture Notes in Logic 2, J. Väänänen, and J.
Oikkonen (eds.), Berlin: Springer, pp. 122–144; reprinted in
Hintikka, J., 1998, Language, Truth and Logic in Mathematics
(Jaakko Hintikka: Selected Papers, Volume 3), Dordrecht: Kluwer, pp.
225–247. (Scholar)
- –––, 1995, “What is Elementary Logic?
Independence-Friendly Logic as the True Core Area of Logic,” in
Physics, Philosophy and the Scientific Community, K.
Gavroglu, J. J. Stachel, and M. W. Wartofsky (eds.), Dordrecht:
Kluwer, pp. 301–326; page reference is to the reprint in
Hintikka, J., 1998, Language, Truth and Logic in Mathematics
(Jaakko Hintikka: Selected Papers, Volume 3), Dordrecht: Kluwer, 1998,
pp. 1–26. (Scholar)
- –––, 1996, The Principles of Mathematics Revisited, Cambridge: Cambridge University Press. (Scholar)
- –––, 1997, “No Scope for Scope?,” Linguistics and Philosophy, 20: 515–544; reprinted in Hintikka, J., 1998, Paradigms for Language Theory and Other Essays (Jaakko Hintikka: Selected Papers, Volume 4), Dordrecht: Kluwer, pp. 22–51. (Scholar)
- –––, 1997, “A Revolution in the Foundations of Mathematics?,” Synthese, 111: 155–170; reprinted in Hintikka, J., 1998, Language, Truth and Logic in Mathematics (Jaakko Hintikka: Selected Papers, Volume 3), Dordrecht: Kluwer, pp. 45–61. (Scholar)
- –––, 1998, “Truth Definitions, Skolem Functions and Axiomatic Set Theory,” Bulletin of Symbolic Logic, 4: 303–337. (Scholar)
- –––, 1999, Inquiry as Inquiry: A Logic of
Scientific Discovery (Jaakko Hintikka: Selected Papers, Volume
5), Dordrecht: Kluwer. (Scholar)
- –––, 2000, “Game-Theoretical Semantics as a Challenge to Proof Theory,” Nordic Journal of Philosophical Logic, 4(2): 127–141. (Scholar)
- –––, 2001, “Post-Tarskian Truth,” Synthese, 126: 17–36. (Scholar)
- –––, 2002a, “Hyperclassical Logic (a.k.a. IF Logic) and its Implications for Logical Theory,” Bulletin of Symbolic Logic, 8: 404–423. (Scholar)
- –––, 2002b, “Quantum Logic is a Fragment of Independence-Friendly Logic,” Journal of Philosophical Logic, 31: 197–209. (Scholar)
- –––, 2002c, “Negation in Logic and in Natural Language,” Linguistics and Philosophy, 25: 585–600. (Scholar)
- –––, 2003, “A Second-Generation Epistemic
Logic and Its General Significance,” in Knowledge
Contributors, V. F. Hendricks, K. F. Jørgensen, and S. A.
Pedersen (eds.), Dordrecht: Kluwer, pp. 33–55; reprinted in
Hintikka, J., 2007, Socratic Epistemology, New York:
Cambridge University Press, pp. 61–82. (Scholar)
- –––, 2004a, “Independence-Friendly Logic and Axiomatic Set Theory,” Annals of Pure and Applied Logic, 126: 313–333. (Scholar)
- –––, 2004b, “What is the True Algebra of Logic,” in First-Order Logic Revisited, V. F. Hendricks, F. Neuhaus, S. A. Pedersen, U. Scheffler, and H. Wansing (eds.), Berlin: Logos Verlag, pp. 117–128. (Scholar)
- –––, 2006a, “Intellectual
Autobiography” and Hintikka’s replies to the contributors
in Auxier & Hahn (2006). (Scholar)
- –––, 2006b, “Truth, Negation and Other Basic Notions of Logic” in The Age of Alternative Logics, J. van Benthem, G. Heinzmann, M. Rebuschi, and H. Visser (eds.), Berlin: Springer, pp. 195–219. (Scholar)
- –––, 2008, “IF Logic in a Wider Setting:
Probability and Mutual Dependence,” in Dialogues, Logics and
Other Strange Things, C. Dégremont, L. Keiff, and H.
Rückert (eds.), London: College Publications, pp.
195–211. (Scholar)
- Hintikka, J., and Kulas, J., 1983, The Game of Language: Studies in Game-Theoretical Semantics and Its Applications, Dordrecht: Reidel. (Scholar)
- –––, 1985, Anaphora and Definite Descriptions: Two Applications of Game-Theoretical Semantics, Dordrecht: Reidel. (Scholar)
- Hintikka, J., and Sandu, G., 1989, “Informational
Independence as a Semantical Phenomenon,” in Logic,
Methodology and Philosophy of Science, Vol. 8, J. E. Fenstad, I.
T. Frolov, and R. Hilpinen (eds.), Amsterdam: Elsevier, pp.
571–589; reprinted in Hintikka, J., 1998, Paradigms for
Language Theory and Other Essays (Jaakko Hintikka: Selected
Papers, Volume 4), Dordrecht: Kluwer, pp. 52–70. (Scholar)
- –––, 1991, On the Methodology of
Linguistics: A Case Study, Oxford: Basic Blackwell. (Scholar)
- –––, 1996, “A Revolution in Logic?,” Nordic Journal of Philosophical Logic, 1(2): 169–183; reprinted in Hintikka, J., 1998, Language, Truth and Logic in Mathematics (Jaakko Hintikka: Selected Papers, Volume 3), Dordrecht: Kluwer, 1998, pp. 27–44. (Scholar)
- –––, 1997, “Game-Theoretical Semantics,” in Handbook of Logic and Language, J. van Benthem, and A. ter Meulen (eds.), Amsterdam: Elsevier, pp. 361–410. (Scholar)
- –––, 1999, “Tarski’s Guilty Secret:
Compositionality,” in Alfred Tarski and the Vienna
Circle, J. Wolenski, and E. Köhler (eds.), Dordrecht:
Kluwer, pp. 217–230. (Scholar)
- Hodges, W., 1983, “Elementary Predicate Logic,” in Handbook of Philosophical Logic, Vol. 1, D. M. Gabbay, and F. Guenthner (eds.), Dordrecht: Reidel, pp. 1–131. (Scholar)
- –––, 1993, Model Theory, in Encyclopedia of Mathematics and its Applications (Volume 42), Cambridge: Cambridge University Press. (Scholar)
- –––, 1997a, “Compositional Semantics for a Language of Imperfect Information,” Logic Journal of the IGPL, 5: 539–563. (Scholar)
- –––, 1997b, “Some Strange
Quantifiers,” in Structures in Logic and Computer Science: A
Selection of Essays in Honor of A. Ehrenfeucht, (Lecture Notes in
Computer Science, Volume 1261) J. Mycielski, G. Rozenberg, and A.
Salomaa (eds.), London: Springer, pp. 51–65. (Scholar)
- –––, 1998, “Compositionality Is Not the Problem,” Logic and Logical Philosophy, 6: 7–33. (Scholar)
- –––, 2006, “The Logic of
Quantifiers,” in Auxier & Hahn (2006), pp.
521–534. (Scholar)
- –––, 2007, “Logics of Imperfect
Information: Why Sets of Assignments?,” in Interactive
Logic, J. van Benthem, D. M. Gabbay, and B. Löwe (eds.),
Amsterdam: Amsterdam University Press, pp. 117–133. (Scholar)
- –––, 2013, “Logic and Games,” in The Stanford Encyclopedia of Philosophy (Spring 2013 Edition), E. Zalta (ed.), URL = <https://plato.stanford.edu/archives/spr2013/entries/logic-games/>. (Scholar)
- Hyttinen, T., and Sandu, G., 2000, “Henkin Quantifiers and the Definability of Truth,” Journal of Philosophical Logic, 29: 507–527. (Scholar)
- Janssen, T. M. V., 1997, “Compositionality,” in
Handbook of Logic and Language, J. van Benthem, and A. ter
Meulen (eds.), Amsterdam: Elsevier, pp. 417–473. (Scholar)
- –––, 2002, “Independent Choices and the Interpretation of IF Logic,” Journal of Logic, Language and Information, 11: 367–387. (Scholar)
- –––, 2013, “Compositional Natural Language Semantics using Independence Friendly Logic or Dependence Logic,” Studia Logica, 101(2): 453–466. (Scholar)
- Janssen, T. M. V., and Dechesne, F., 2006, “Signaling in
IF-Games: A Tricky Business,” in The Age of Alternative
Logics, J. van Benthem, G. Heinzmann, M. Rebuschi, and H. Visser
(eds.), New York: Springer, pp. 221–241. (Scholar)
- Jónsson, B., and Tarski, A., 1951, “Boolean Algebras
with Operators, Part I,” American Journal of
Mathematics, 73: 891–939. (Scholar)
- Kaye, R., 1991, Models of Peano Arithmetic, Oxford: Clarendon Press. (Scholar)
- Kontinen, J., Kuusisto, A., Lohmann, P., and Virtema, J. (eds.),
2014, “Complexity of Two-Variable Dependence Logic and
IF-Logic,” Information and Computation, 239:
237–253. (Scholar)
- Kontinen, J., Väänänen, J., and Westerståhl,
D. (eds.), 2013, Dependence and Independence in Logic,
special issue of Studia Logica, 101(2). (Scholar)
- Krynicki, M., 1993, “Hierarchies of Partially Ordered Connectives and Quantifiers,” Mathematical Logic Quarterly, 39: 287–294. (Scholar)
- Krynicki, M., and Lachlan, A. H., 1979, “On the Semantics of the Henkin Quantifier,” Journal of Symbolic Logic, 44(2): 184–200. (Scholar)
- Krynicki, M., and Mostowski, M., 1995, “Henkin Quantifiers” in Quantifiers: Logics, Models and Computation, Vol. 1, M. Krynicki, M. Mostowski, and L. W. Szczerba (eds.), Dordrecht: Kluwer, pp. 193–262. (Scholar)
- Kuusisto, A., 2013. “Expressivity of Imperfect Information Logics without Identity,” Studia Logica, 101(2): 237–265. (Scholar)
- Leivant, D., 1994, “Higher Order Logic,” in
Handbook of Logic in Artificial Intelligence and Logic
Programming, Vol. 2, D. M. Gabbay, C. J. Hogger, J. A. Robinson,
and J. H. Siekmann, (eds.), Oxford: Clarendon Press, pp.
229–321. (Scholar)
- Mann, A. L., 2007, Independence-Friendly Cylindric Set Algebras, Ph.D. thesis, University of Colorado at Boulder. (Scholar)
- Mann, A. L., Sandu, G., and Sevenster, M., 2011, Independence-Friendly Logic: A Game-Theoretic Approach, Cambridge: Cambridge University Press. (Scholar)
- Marion, M., 2009, “Why Play Logical Games?,” in Games: Unifying Logic, Language and Philosophy, O. Majer, A.-V. Pietarinen, and T. Tulenheimo (eds.), New York: Springer-Verlag, pp. 3–25. (Scholar)
- McKinsey, J. C. C., and Tarski, A., 1948, “Some Theorems About the Sentential Calculi of Lewis and Heyting,” Journal of Symbolic Logic, 13(1): 1–15. (Scholar)
- Mostowski, A., 1957, “On a Generalization of Quantifiers,” Fundamenta Mathematicae, 44: 12–36. (Scholar)
- Mostowski, M., 1991, “Arithmetic with the Henkin Quantifier and its Generalizations,” in Séminaire du Laboratoire Logique, Algorithmique et Informatique Clermontoise, Vol. 2, F. Gaillard, and D. Richard (eds.), pp. 1–25. (Scholar)
- Odintsov, S., Speranski, S., and Shevchenko, I., 2018.
“Hintikka’s Independence-Friendly Logic Meets
Nelson’s Realizability,” Studia Logica, 106(3):
637–670. (Scholar)
- Papadimitriou, C. H., 1994, Computational Complexity,
Reading, MA: Addison-Wesley. (Scholar)
- Patton, T. E., 1991, “On the Ontology of Branching Quantifiers,” Journal of Philosophical Logic, 20: 205–223. (Scholar)
- Peters, S., and Westerståhl, D., 2006, Quantifiers in Language and Logic, Oxford: Oxford University Press. (Scholar)
- Pietarinen, A.-V., 2001, Semantic Games in Logic and
Language, Ph.D. thesis, Helsinki: University of Helsinki. (Scholar)
- Quine, W. V. O., 1970, Philosophy of Logic, Englewood Cliffs, NJ: Prentice-Hall. (Scholar)
- Rebuschi, M., and Tulenheimo, T., 2011, “Between De
Dicto and De Re: De Objecto Attitudes,”
The Philosophical Quarterly, 61(245): 828–838. (Scholar)
- Reinhart, T., 1997, “Quantifier Scope: How Labor is Divided between QR and Choice Functions,” Linguistics and Philosophy, 20: 335–397. (Scholar)
- de Rouilhan, P., and Bozon, S., 2006, “The Truth of IF: Has
Hintikka Really Exorcised Tarski’s Curse?,” in Auxier
& Hahn (2006), pp. 683–705. (Scholar)
- Sandu, G., 1991, Studies in Game-Theoretical Logics and
Semantics, Ph.D. thesis, Helsinki: University of Helsinki.
(Includes Hintikka & Sandu 1989; Sandu 1993, 1994; Sandu &
Väänänen 1992.) (Scholar)
- –––, 1993, “On the Logic of Informational Independence and its Applications,” Journal of Philosophical Logic, 22: 29–60. (Scholar)
- –––, 1994, “Some Aspects of Negation in English,” Synthese, 99(3): 345–360. (Scholar)
- –––, 1996, Appendix to Hintikka (1996), pp.
254–270. (Scholar)
- –––, 1998, “IF-Logic and Truth-Definition,” Journal of Philosophical Logic, 27: 143–164. (Scholar)
- –––, 2001, “Signalling in Languages with Imperfect Information,” Synthese, 127: 21–34. (Scholar)
- –––, 2007, Appendix to Les principes des
mathématiques revisités, French transl. of Hintikka
(1996) by M. Rebuschi, Paris: Vrin, pp. 285–300. (The appendix
is new and the translation of the book is based on Hintikka’s
revision of Hintikka 1996.) (Scholar)
- –––, 2013, “Probabilistic IF Logic,” in Logic and Its Applications, K. Lodaya (ed.), Heidelberg: Springer, pp. 69–79. (Scholar)
- –––, 2014, “Truth and Probability in
Game-Theoretical Semantics,” Teorema: Revista Internacional
de Filosofía, 33(2): 151–170. (Scholar)
- Sandu, G., and Hintikka, J., 2001, “Aspects of Compositionality,” Journal of Logic, Language and Information, 10: 49–61. (Scholar)
- Sandu, G., and Hyttinen, T., 2001, “IF logic and The Foundations of Mathematics,” Synthese, 126: 37–47. (Scholar)
- Sandu, G., and Sevenster, M., 2010, “Equilibrium Semantics of Languages of Imperfect Information,” Annals of Pure and Applied Logic, 161: 618–631. (Scholar)
- Sandu, G., and Väänänen, J., 1992, “Partially Ordered Connectives,” Zeitschrift für matematische Logik und Grundlagen der Mathematik, 38: 361–372. (Scholar)
- Sevenster, M., 2006, Branches of Imperfect Information: Logic,
Games, and Computatation, Ph.D. thesis, Amsterdam: University of
Amsterdam. (Scholar)
- –––, 2014, “Dichotomy Result for Independence-Friendly Prefixes of Generalized Quantifiers,” Journal of Symbolic Logic, 79(4): 1224–1246. (Scholar)
- Skolem, T., 1920, “Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen,” Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisk-naturvidenskabelig klasse, no. 4, pp. 1–36; reprinted in T. Skolem, Selected Works in Logic, J. E. Fenstad (ed.), Oslo: Universitetsforlaget, 1970, pp. 103–136. (Scholar)
- Steedman, M., 2012, Taking Scope. The Natural Semantics of
Quantifiers, Cambridge, MA: The MIT Press. (Scholar)
- Tarski, A., 1933, “The Concept of Truth in the Languages of
the Deductive Sciences” (Polish), Prace Towarzystwa
Naukowego Warszawskiego, Wydzial III Nauk Matematyczno-Fizycznych
34, Warsaw; expanded English translation in Tarski 1983, pp.
152–278. (Scholar)
- –––, 1983, Logic, Semantics, Metamathematics: Papers from 1923 to 1938, 2nd and revised edition, J. Corcoran (ed.), Indianapolis: Hackett Publishing Company. (Scholar)
- Trakhtenbrot, B., 1950, “Impossibility of an Algorithm for
the Decision Problem in Finite Classes” (Russian), Doklady
Akademii Nauk SSSR, 70: 569–572. (English translation:
American Mathematical Society, Translation Series 2,
23, 1963, pp. 1–5.) (Scholar)
- Tulenheimo, T., 2014, “Classical Negation and Game-Theoretical Semantics,” Notre Dame Journal of Formal Logic, 55: 469–498. (Scholar)
- Väänänen, J., 2001, “Second-Order Logic and Foundations of Mathematics,” Bulletin of Symbolic Logic, 7: 504–520. (Scholar)
- –––, 2002, “On the Semantics of Informational Independence,” Logic Journal of the IGPL, 10(3): 337–350. (Scholar)
- –––, 2006, “A Remark on Nondeterminacy in IF Logic,” Acta Philosophica Fennica, 78, pp. 71–77. (Scholar)
- –––, 2007, Dependence Logic: A New Approach to Independence Friendly Logic, Cambridge: Cambridge University Press. (Scholar)
- von Heusinger, K., 2004, “Choice Functions and the Anaphoric
Semantics of Definite NPs,” Research on Language and
Computation, 2: 309–329. (Scholar)
- Walkoe, W. J. Jr., 1970, “Finite Partially-Ordered Quantification,” Journal of Symbolic Logic, 35: 535–555. (Scholar)
- Westerståhl, D., 1998, “On Mathematical Proofs of the Vacuity of Compositionality,” Linguistics and Philosophy, 21: 635–643. (Scholar)
- Wittgenstein, L., 1953, Philosophische Untersuchungen (Philosophical Investigations), Oxford: Basil Blackwell, transl. by G. E. M. Anscombe. (Scholar)
- Zadrozny, W., 1994, “From Compositional to Systematic Semantics,” Linguistics and Philosophy, 17: 329–342. (Scholar)