Skip to main content

There Is No Recursion in Language

  • Chapter
  • First Online:
Language and Recursion

Abstract

We argue in this paper that there is no recursion in language. Recursion is a mathematical self-calling function, and clearly there is no such thing in language. What Chomsky introduced as recursion in his Syntactic Structures (1957: pp. 23–24) was clearly a loop, and this means that Chomsky’s recursion was at first iteration. The presence or absence of recursion in language is therefore a matter of definition, as is obvious from the various characterisations proposed at the Mons conference. Recursion is generally thought of as a loop, a feedback loop or embedded structures.

The question remains of why recursion in language managed to gain such widespread support in various scientific communities. We offer a number of reasons, one of them inspired by Wittgenstein’s claim that “It is what human beings say that is true and false; and they agree in the language they use. That is not agreement in opinions but in form of life”. Even in the sciences.

“Then Shem Macnamara had been very poor, only too ready for a free meal and a quiet sneer at the success of a fellow poet. Then, instead of expensive mouthwash, he had breathed on Hogg-Enderby, bafflingly (for no banquet would serve, because of the known redolence of onions, onions) onions.

Onions”, said Hogg. He was frowned on in puzzlement. Cocktail onions, he offered. Well just imagine. Shem Macnamara deepened his frown. Something in that voice saying Onions? He did not take any onions.”

“Enderby outside”

Anthony Burgess (Penguin, 1982, p. 224).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.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

Notes

  1. 1.

    For an introduction to “dénomination”, see Kleiber’s Nominales (1994).

  2. 2.

    See my papers and some of Kleiber’s recent ones on http://www.res-per-nomen.org.

  3. 3.

    See also Peirce, who thought that ontologies were only as strong as their foundations, i.e. not at all because all foundations are hypotheses (1868, Fr. tr. 1984: 197).

  4. 4.

    See the beginning of his Philosophical Investigations (PI).

  5. 5.

    On the notion of interpretant, see, for example, §5.473, 5.253 and 2.303, in Peirce’s collected works. French translation in Peirce (1978).

  6. 6.

    The alternative view is a nominalist one: integers are the names of sets.

  7. 7.

    Many thanks to Olga Frath for her patient explanations.

  8. 8.

    Tractatus Logico-Philosophicus (TLP): 5.62.

  9. 9.

    This is why dualism is so resilient. Philosophers, such as Dennett, Chalmers, Popper, Crick, the Churchlands and many more, develop basically dualistic theories, even though some of them (e.g. Dennett) think they do not.

  10. 10.

    See Frath (2012).

  11. 11.

    As was, for example, Jacques Benvéniste’s water memory, the notion that water may retain a “memory” of substances previously dissolved in it.

  12. 12.

    As happened to aether, the nineteenth century notion that space was filled with some physical medium.

  13. 13.

    PI§24. Italics is Wittgenstein’s. Bold is mine.

  14. 14.

    For example, the Fibonacci series can be programmed recursively. By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence F n of Fibonacci numbers is defined by the recurrence relation:

    F = F n−1 + F n−2, with seed values F 0 = 0, F 1 = 1 (adapted from Wikipedia).

    Please note that recurrence can also be achieved by iteration, i.e. a loop. Iteration and recursion are very close and achieve similar results. Both iterative and recursive programmes necessitate a stopping condition to terminate the computing process. If not, computing goes on until the computer is switched off (in the case of iteration) or until the memory is full (in the case of recursion).

  15. 15.

    See Fig. 14.2.

  16. 16.

    “Philosophy is a battle against the bewitchment of our intelligence by means of language” (PI§109).

  17. 17.

    PI§109.

  18. 18.

    PI§98, TLP§5.563, P§I1.

References

  • Bickerton, D. (2009). Recursion: Core of complexity or artifact of analysis. In T. Givón & S. Masayoshi (Eds.), Syntactic complexity: Diachrony, acquisition, neuro-cognition, evolution, vi (pp. 531–544). Amsterdam: John Benjamins Publishing Company.

    Google Scholar 

  • Chomsky, N. (1957). Syntactic structures. Berlin: Mouton de Gruyter. 2002.

    Google Scholar 

  • Frath, P. (2012). La conscience dans la théorie linguistique. In P. Frath, V. Bourdier, E. Hilgert, K. Bréhaux, & J. Dunphy-Blomfield (Eds.), Res-per-nomen III: La référence, la conscience et le sujet énonciateur/Reference, consciousness and the speaking subject. Reims: Editions et Presses Universitaires de Reims.

    Google Scholar 

  • Hauser, M., Chomsky, N., & Fitch, T. (2002). The faculty of language: What is it, who has it, and how did it evolve? Science, 298, 1569–1579.

    Article  PubMed  Google Scholar 

  • Kleiber, G. (1994). Nominales. Essais de sémantique référentielle. Paris: Armand Colin.

    Google Scholar 

  • Peirce, C. S. (1978). Ecrits sur le signe, rassemblés, traduits et commentées par Gérard Deledalle. Paris: Seuil.

    Google Scholar 

  • Peirce, C. S. (1984). “Quelques conséquences de quatre incapacités”. In Textes anticartésiens, traduction de Joseph Chenu, Aubier. 1ère publication : The Journal of Speculative Philosophy, 1868.

    Google Scholar 

  • Wittgenstein, L. (1961). Tractatus logico-philosophicus suivi de Investigations Philosophiques. NRF, Paris: Traduit par Pierre Klossowski.

    Google Scholar 

  • Wittgenstein, L. (1963). Philosophical investigations. Translated by G.E.M Anscombe. Basil Blackwell, Oxford.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre Frath .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this chapter

Cite this chapter

Frath, P. (2014). There Is No Recursion in Language. In: Lowenthal, F., Lefebvre, L. (eds) Language and Recursion. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9414-0_14

Download citation

Publish with us

Policies and ethics