Macros for Minimalism? Towards weak descriptions of strong structures

The Mathematics of Syntactic Structure: Trees and their Logics

Volumn , Issue , 2011, Pages 231-258

  Kolb, Hans Peter ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85145142725     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1515/9783110806786.231     Document Type: Chapter

References (27)

1. Aho, A. V. and J. D. Ullman (1971): Translations on a context-free grammar.Information and Control 19:439-475
2. Bloem, R. and J. Engelfriet (1997): Characterization of properties and relations defined in Monadic Second Order logic on the nodes of trees. Tech.Rep. 97-03, Dept. of Computer Science, Leiden University
3. Brody, M. (1995): Lexico-Logical Form. Cambridge, Ma.: MIT Press
4. Chomsky, N. (1975): The Logical Structure of Linguistic Theory. New York:Plenum, (also 1985, UChicago Press)
5. Chomsky, N. (1985): Barriers. Cambridge, MA: MIT Press
6. Chomsky, N. (1995): The Minimalist Program. Cambridge, MA: MIT Press
7. Courcelle, B. (1990): Graph rewriting: An algebraic and logic approach. In:J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier, vol. B, pp. 193-242
8. Doner, J. E. (1970): Tree acceptors and some of their applications. J. Comput.System Sei. 4:406-451
9. Ebbinghaus, H.-D., J. Flum, and W. Thomas (1996): Einführung in die mathematische Logik. Heidelberg: Spektrum, 4th edn.
10. Fischer, M. J. (1968): Grammars with macro-like productions. In: Proceedings of the 9th Annual Symposium on Switching and Automata Theory, IEEE, pp. 131-142
11. Frank, R. and K. Vijay-Shanker (1998): Primitive c-command. Ms., Johns Hopkins University and Universtiy of Delaware
12. Gurevich, Y. (1985): Monadic second-order theories. In: J. Barwise and S. Feferman (eds.), Model-Theoretic Logics, Berlin/New York: Springer, Perspectives in Mathematical Logic, chap. ΧΠΙ, pp. 479-506
13. Huybregts, M. A. C. (1976): Overlapping dependencies in dutch. Utrecht Working Papers in Linguistics 1:24-65
14. Huybregts, M. A. C. (1984): The weak adequacy of context-free phrase structure grammar. In: G. J. de Haan, M. Trommelen, and W. Zonneveld (eds.), Van periferie naar kern, Dordrecht: Foris, pp. 81-99
15. Johnson, D. and S. Lappin (1996): A critique of the minimalist program. Ms., IBM Watson Research Center and SOAS
16. Kayne, R. (1994): The Antisymmetry of Syntax. Cambridge, Ma.: MIT Press
17. Kolb, H.-P. (1995): Segments, categories, and other dangerous things.Ms., also in: Kolb (1997), pp. 13-26
18. Kolb, H.-P. (1997): GB Blues: Two essays on procedures and structures in generative grammar. Bericht 110, Arbeitspapiere des SFB 340, Tübingen/Stuttgart
19. Maibaum, T. S. E. (1974): A generalized approach to formal languages. J.Comput. System Sei. 8:409-439
20. Mezei, J. and J. B. Wright (1967): Algebraic automata and contextfree sets.Inform, and Control 11:3-29
21. Miller, P. H. (1991): Scandinavian extraction phenomena revisited: Weak and strong generative capacity. Linguistics and Philosophy 14:101-113
22. Mönnich, U. (1999): On cloning contextfreeness. This volume, pp. 195-229
23. Rabin, M. O. (1969): Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141:1-35
24. Rogers, J. (1994): Studies in the Logic of Trees with Applications to Grammar Formalisms. Ph.D. thesis, University of Delaware
25. Rounds, W. C. (1970): Tree-oriented proofs of some theorems on context-free and indexed languages. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, pp. 109-116
26. Shieber, S. M. (1985): Evidence against the context-freeness of natural language.Linguistics and Philosophy 8(3): 333-344
27. Thatcher, J. W. and J. B. Wright (1968): Generalized finite automata theory with an application to a decision problem of second-order logic. Math.Systems Theory 2(1):57-81