Abstract
Despite their other similarities, the frameworks of Derivational Minimalism and Resource Logic differ in the method of semantic computation. We argue that a system based on a hybrid logicincorporates features from both traditions, and so occupies a ``middle ground'' between the two.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bach E. (1989) Informal Lectures on Formal Semantics. State University of New York Press.
Carpenter B. (1994) Quantification and Scoping: A Deductive Account. manuscript.
Joshi A.K., Kulick S. (1997) Partial Proof Trees as Building Blocks for a Categorial Grammar. Linguistics and Philosophy, 20, pp. 637-667.
Joshi A.K., Kulick S., Kurtonina N. (1998) An LTAG Perspective on Categorial Grammar. Presented at Logical Aspects of Computational Linguistics.
Lecomte A., Retoré C. (1996) Words as Modules and Modules as Partial Proof-nets. In Benjamins J. (ed.), Proceedings of ICML 96.
Moortgat M. (1997) Categorial Type Logics. In Van Benthem J., Ter Meulen A. (eds.), Handbook of Logic and Language, North Holland.
Morrill G. (1994) Type Logical Grammar — Categorial Logic of Signs. Kluwer, Dordrecht.
Stabler E. (1996) Computing Quantifier Scope. In Szabolcsi (ed.), Ways of Scope Taking, Kluwer, pp. 155-182.
Steedman M. (1996) Surface Structure and Interpretation, Number 30 in Linguistic Inquiry Monograph, MIT Press.
Author information
Authors and Affiliations
About this article
Cite this article
Joshi, A.K., Kulick, S. & Kurtonina, N. Partial Proof Trees, Hybrid Logic, and Quantifier Scope. Research on Language and Computation 2, 57–68 (2004). https://doi.org/10.1023/A:1025479204785
Issue Date:
DOI: https://doi.org/10.1023/A:1025479204785