Abstract
‘Cat’ is a word which occurs in ‘cattle’, but it does not occur as a word; ‘1 + 2’ is a term which occurs in ‘1 + 2.3’, but it does not occur as a term. All such occurrences of expressions might be said to be accidental, since they are accidents of how the syntax of the language happens to be realized.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fine, K., Transparency I and II, submitted to Language and Control.
Harrison, M. A., Introduction to Formal Language Theory, Addison-Wesley, Massachusetts.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag New York, Inc
About this paper
Cite this paper
Fine, K. (1992). Transparent Grammars. In: Moschovakis, Y.N. (eds) Logic from Computer Science. Mathematical Sciences Research Institute Publications, vol 21. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2822-6_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2822-6_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7685-2
Online ISBN: 978-1-4612-2822-6
eBook Packages: Springer Book Archive