Abstract
Within and across theoretical frameworks, linguists have debated whether various phenomena related to variable binding should be handled within syntax, as part of a syntax-to-semantics mapping, or possibly by one or more separate levels of rules or principles specifically dedicated to such phenomena. Relevant phenomena include the interpretation of pronouns and reflexives as bound variables and the binding of gaps or traces by WH-phrases or other operators. Given current interest in the generative capacity of alternative syntactic theories, it is important to note that whatever level of grammatical description deals with variable binding must involve some non-context-freeness if certain natural restrictions on well-formedness (spelled out below) are taken to belong to grammar at all. In this paper we investigate the formal properties of variable binding via an investigation of two restricted versions of predicate logic. We first review the familiar fact that the set L of formulas of first-order predicate logic (FOPL) (allowing free variables and vacuous quantifiers) is a context free (CF) language. We then consider two restricted sublanguages of L, the set S of Sentences of FOPL (formulas with no free variables), and the set U of formulas of FOPL with no vacuous quantifiers. Both S and U can be shown by established methods to be non-CF.
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
Aho, Alfred V. (1968) “Indexed Grammars - An Extension of Context-Free Grammars”, JACM 15, 647–671.
Engdahl, Elisabet (1980) Questions in Swedish, unpublished doctoral dissertation, University of Massachusetts, Amherst.
Fodor, Janet, (1970) “Formal linguistics and formal logic” in John Lyons, ed., New Horizons in Linguistics, Penguin Books Ltd., Middlesex, pp. 198–214.
Higginbotham, James (1984) “English is not a Context-Free Language”, Linguistic Inquiry, 15, 225–234.
Hopcroft, J. E. and J. Ullman (1979) Introduction to Automata Theory, Languages and Computation, Addison Wesley.
Lewis, David (1975) “Adverbs of quantification”, in E. L. Keenan, ed., Formal Semantics of Natural Language, Cambridge Univ. Press, Cambridge, (3–15).
Partee, Barbara (1979a) “Montague Grammar and the Well-Formedness Constraint”, in F. Heny and H. Schnelle, eds., Syntax and Semantics, vol. 10 (275–313).
Partee, Barbara (1979b) “Constraining Montague grammar: a framework and a fragment”, in S. Davis and M. Mithun (eds.) Linguistics, Philosophy and Montague Grammar, University of Texas Press, Austin (52–101).
Pullum, Geoffrey K. (1983) “Context-freeness and the computer processing of human languages”, Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, pp. 1–6.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Marsh, W., Partee, B.H. (1987). How Non-Context Free is Variable Binding?. In: Savitch, W.J., Bach, E., Marsh, W., Safran-Naveh, G. (eds) The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, vol 33. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3401-6_16
Download citation
DOI: https://doi.org/10.1007/978-94-009-3401-6_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-55608-047-0
Online ISBN: 978-94-009-3401-6
eBook Packages: Springer Book Archive