Abstract
This paper uses standard syntactic scoping properties (as found with lambda calculus and predicate logic) to account for linking dependencies in Tukang Besi, an Austronesian language of Indonesia. Basic argument dependencies are established with a combination of verbal agreement, case marking and constituent order. If taken alone, no one of these is sufficient to determine the grammatical relations in the clause. Rather these different factors operate in combination to yield unambiguous clauses. What is shown is that scope taking options determine which combinations are possible and which are impossible.
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
Andrews, Avery: The major functions of noun phrase. In: Shopen, T. (ed.) Language typology and syntactic description. Clause structure, vol. I, pp. 62–154. Cambridge University Press, Cambridge (1985)
Barendregt, H.P.: The lambda calculus: Its syntax and semantics. North-Holland, Amsterdam (1984)
Butler, Alastair: Binding effects with scope control. Research on Language and Computation 4, 54–76 (2006)
Comrie, Bernard: Ergativity. In: Lehmann, W.P. (ed.) Syntactic typology: Studies in the phenomenology of language, pp. 329–394. The Harvester Press, Sussex (1978)
Donohue, Mark: A Grammar of Tukang Besi. Grammar Library Series, vol. 20. Mouton de Gruyter, Berlin (1999)
Stehr, Mark-Oliver: Programming, specification, and interactive theorem proving: Towards a unified language based on equational logic, rewriting logic, and type theory. Ph.D. thesis, Fachbereich Informatik, Universität Hamburg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butler, A., Donohue, M. (2007). Argument Dependencies in Tukang Besi. In: ten Cate, B.D., Zeevat, H.W. (eds) Logic, Language, and Computation. TbiLLC 2005. Lecture Notes in Computer Science(), vol 4363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75144-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-75144-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75143-4
Online ISBN: 978-3-540-75144-1
eBook Packages: Computer ScienceComputer Science (R0)