Showing a limited preview of this publication:
Abstract
We examine lambda calculus as a sign system and show that it explains important properties of language. First, we verify that a lambda-term has two essential functionalities of signs — articulation and naming — and argue that a lambda-term can thus be regarded as a sign model. Then, when signs are defined by self-reference, we show that these two functionalities become tightly coupled and that dyadic/triadic sign models become equivalent. Last, we show that the difference of structuralism is explained in relation to the undecidability of the equivalence of two arbitrary lambda-terms.
Published Online: 2008-04-24
Published in Print: 2008-April
© 2008 by Walter de Gruyter GmbH & Co. KG, D-10785 Berlin
