Skip to main content
Log in

Hintikka on the Foundations of Mathematics: IF Logic and Uniformity Concepts

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

The initial goal of the present paper is to reveal a mistake committed by Hintikka in a recent paper on the foundations of mathematics. His claim that independence-friendly logic (IFL) is the real logic of mathematics is supported in that article by an argument relying on uniformity concepts taken from real analysis. I show that the central point of his argument is a simple logical mistake. Second and more generally, I conclude, based on the previous remarks and on another standard fact of IFL, that first-order logic (FOL) can adequately express uniformity concepts in real analysis, whereas IFL (understood as a non-trivial extension of FOL) cannot. This not only radically contradicts Hintikka’s particular claim in that article, but also undermines his whole enterprise of founding mathematics on his logic system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. These names come from the quantifier symbols ∃ and ∀. A more accurate way of describing the roles of the two players is by saying that Eloise is the initial verifier, and Abelard the initial falsifier, the reason being that the function of negation in GTS is to swap players’ roles. We shall not be concerned with these matters here.

  2. Strict equivalence is both truth- and falsity-equivalent. By “equivalence” we mean logical equivalence, namely equivalence in every model.

  3. As an anonymous referee pointed out to me, there is another problematic passage in Hintikka’s paper in which he mistakenly takes uniform continuity as a local property of functions (on a par with continuity simpliciter), where it is in fact a global property (cf. [6, p. 467]).

  4. It should be stressed at this point that, strictly speaking, the question is misplaced. FOL is a fragment of IFL in which every independent quantifier has the empty form \((Qv/\varnothing )\), hence uniformity concepts expressible in FOL are also expressible in IFL a fortiori. What we are really asking ourselves is whether we need (non-trivial) independent quantifiers for expressing uniformity, as in Eq. 5. The answer is that we need no such quantifiers, and what is more, that we cannot adequately use them for such purposes.

References

  1. Dechesne, F. (2005). Game, sets, math: Formal investigations into logic with imperfect information. PhD thesis, Tilburg University, Tilburg.

  2. Enderton, H.B. (1970). Finite partially ordered quantifiers. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 16, 393–397.

    Article  Google Scholar 

  3. Gleason, A.M. (1991). Fundamentals of abstract analysis. Boston: Jones and Bartlett.

    Google Scholar 

  4. Hintikka, J. (1973). Quantifiers vs. quantification theory. Dialectica, 27(3-4), 329–358.

    Article  Google Scholar 

  5. Hintikka, J. (1996). The principles of mathematics revisited. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  6. Hintikka, J. (2012). Which mathematical logic is the logic of mathematics? Logica Universalis, 6(3-4), 459–475.

    Article  Google Scholar 

  7. Hintikka, J., & Sandu, G. (1989). Informational independence as a semantical phenomenon. In: J. E. Fenstad, & et al. (Eds.) In Logic, methodology and philosophy of science VIII, Amsterdam, (pp. 571–590).

  8. Hintikka, J., & Sandu, G. (1996). A revolution in logic? Nordic Journal of Philosophical Logic, 1(2), 169–183.

    Google Scholar 

  9. Hintikka, J., & Sandu, G. (1997). Game-theoretical semantics. In: A. ter Meulen, & J. van Benthem (Eds.) In Handbook of logic and language. Elsevier, Amsterdam, (pp. 361–410).

  10. Hodges, W. (1997). Compositional semantics for a language of imperfect information. Logic Journal of the IGPL, 5(4), 539–563.

    Article  Google Scholar 

  11. Hodges, W. (2006). The logic of quantifiers. In: [13], (pp. 521–534).

  12. Mann, A.L., Sandu, G., Sevenster, M. (2011). Independence-friendly logic: A game-theoretic approach. London mathematical society, lecture note series (386). Cambridge:Cambridge University Press.

  13. Randall, E.A., & Hahn, L.E. (Eds.) (2006). The philosophy of Jaakko Hintikka. Library of living philosophers (Book 30), Open Court, Chicago.

  14. Sandu, G., & Hintikka, J. (2001). Aspects of compositionality. Journal of Logic, Language, and Information, 10, 49–61.

    Article  Google Scholar 

  15. Walkoe, W.J. (1970). Finite partially-ordered quantification. Journal of Symbolic Logic, 35(4), 535–555.

    Article  Google Scholar 

Download references

Acknowledgments

I would like to thank two anonymous referees for their useful remarks and suggestions on a previous version of the present paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to André Bazzoni.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bazzoni, A. Hintikka on the Foundations of Mathematics: IF Logic and Uniformity Concepts. J Philos Logic 44, 507–516 (2015). https://doi.org/10.1007/s10992-014-9340-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10992-014-9340-8

Keywords

Navigation