Skip to main content

The Logic of Intensional Predicates

  • Chapter
Foundations of the Formal Sciences II

Part of the book series: Trends in Logic ((TREN,volume 17))

  • 370 Accesses

Abstract

This paper gives a personal overview of the current situation concerning the logical theory of intensional predicates. It is shown how several intensional notions, when logically treated as predicates, yield liar-like paradoxes. Some consistent semantic and axiomatic theories of intensional predicates are presented and discussed. To conclude, an inquiry is made into the conceptual relation between truth and intensional notions.

I am grateful to Benedikt Löwe for inviting me to present a paper at the Foundations of the Formal Sciences II conference. Thanks to Volker Halbach, Hannes Leitgeb and Philip Welch for helpful comments and for information about their joint work in progress.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. On the operator approach, the desired forms of quantification could be realised by introducing propositional quantifiers into the formal language. But then, given sufficient expressive power, liar-like paradoxes can be generated, as in the predicate approach. For details, see [Gri93].

    Google Scholar 

  2. Due to Kaplan and Montague, 1960. The paradox was also, seemingly independently, discovered by Myhill. Cf. [Myh60].

    Google Scholar 

  3. Cf. [Mon63].

    Google Scholar 

  4. A stands for the Gödel number of A.

    Google Scholar 

  5. See [Tho0 80].

    Google Scholar 

  6. Cf. [Hor1 Lei01].

    Google Scholar 

  7. Cf. [FriShe87, p. 14].

    Google Scholar 

  8. Cf. [McG85].

    Google Scholar 

  9. Cf. [Tar56a].

    Google Scholar 

  10. Cf. [Kri175].

    Google Scholar 

  11. Cf. [Fef91].

    Google Scholar 

  12. Cf. [Can90].

    Google Scholar 

  13. Cf. [Hal0 94].

    Google Scholar 

  14. Cf., e.g., [Mor186].

    Google Scholar 

  15. The approach sketched here is worked out in more detail in [Hor198].

    Google Scholar 

  16. A good introduction to possible worlds semantics for modal logic is [Hug1Cre96].

    Google Scholar 

  17. For details, consult [Hal0LeiWel∞].

    Google Scholar 

  18. See the articles in [Sha185a]. Reinhardt has also contributed significantly to this research program. See, e.g., [Rei086a].

    Google Scholar 

  19. This is clearly brought out in [And83].

    Google Scholar 

  20. This way of formulating a formal theory of Predicate Epistemic Arithmetic is due to Friedman and Sheard in [FriShe87].

    Google Scholar 

  21. History is our witness here. [Göd33] contains the first attempt to formulate an axiomatic theory of absolute provability (treated as an operator). He lists the S4 principles.

    Google Scholar 

  22. See [Ger170, p. 36–37]; [FriShe87, p. 7(chart 1)]; [Nie91, p. 36]. PEA is considerably stronger than the system that was proposed in [Myh60, p. 469–470], which appears to be one of the earliest attempts to consistently formalise informal provability as a primitive predicate.

    Google Scholar 

  23. This observation is due to Fitch, cf. [Fit063]. In the philosophical community, Fitch’s argument has generated an extensive discussion. For an overview, see, e.g., [Wil100, Chapter 12].

    Google Scholar 

  24. For proofs and a more detailed discussion of these results, see [Hor102].

    Google Scholar 

  25. Cf. [Rei086a].

    Google Scholar 

  26. Something similar holds for Cantini’s system VF.

    Google Scholar 

  27. In this respect, we have now argued ourselves into a position that is in line with the HalbachLeitgeb-Welch approach.

    Google Scholar 

  28. Note that the same question can be asked about many popular axiomatic theories of truth. In my opinion, logical and philosophical questions regarding the relation between inner logic and outer logic have until now not received the attention they deserve.

    Google Scholar 

  29. For proofs of these results, the reader is again referred to [Hor102].

    Google Scholar 

  30. This observation is due to Halbach.

    Google Scholar 

  31. Cf. [Göd33].

    Google Scholar 

  32. An elegant proof of this theorem is given in [FriFla86].

    Google Scholar 

  33. If one takes a Tarskian point of view, then one will insist on one more parameter: one will insist that truth is also always relative to a language.

    Google Scholar 

  34. Note, in this context, that the notion of actually having an informal proof is not, as far as we know, subject to liar-like paradoxes.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Horsten, L. (2003). The Logic of Intensional Predicates. In: Löwe, B., Malzkom, W., Räsch, T. (eds) Foundations of the Formal Sciences II. Trends in Logic, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0395-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0395-6_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6233-8

  • Online ISBN: 978-94-017-0395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics